4,015,956

2² × 3 × 7 × 47809

4,015,956 factors as 2^2 × 3 × 7 × 47809. Its 24 positive divisors give a proper-divisor sum of 6,693,484, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 47809

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 10,709,440

Proper Divisor Sum 6,693,484

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4015939 ← → #4015981

Radix Representation

Decimal	4015956
Binary	1111010100011101010100 (22 bits)
Octal	0o17243524
Hexadecimal	0x3D4754

Divisor Catalog (24)

1 2 3 4 6 7 12 14 21 28 42 84 47,809 95,618 143,427 191,236 286,854 334,663 573,708 669,326 1,003,989 1,338,652 2,007,978 4,015,956

Collatz Trajectory (154 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

4,015,956 2,007,978 1,003,989 3,011,968 1,505,984 752,992 376,496 188,248 94,124 47,062 23,531 70,594 35,297 105,892 52,946 26,473 79,420 39,710 19,855 59,566 29,783 89,350 44,675 134,026 67,013 201,040 100,520 50,260 25,130 12,565 37,696 18,848 9,424 4,712 2,356 1,178 589 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121

← Previous Integer #4,015,955 Browse Full Index Next Integer #4,015,957 →