3,902,688

2⁵ × 3³ × 4517

3,902,688 factors as 2^5 × 3^3 × 4517. Its 48 positive divisors give a proper-divisor sum of 7,482,672, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2^5 × 3^3 × 4517

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 11,385,360

Proper Divisor Sum 7,482,672

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3902687 ← → #3902713

Radix Representation

Decimal	3902688
Binary	1110111000110011100000 (22 bits)
Octal	0o16706340
Hexadecimal	0x3B8CE0

Divisor Catalog (48)

1 2 3 4 6 8 9 12 16 18 24 27 32 36 48 54 72 96 108 144 216 288 432 864 4,517 9,034 13,551 18,068 27,102 36,136 40,653 54,204 72,272 81,306 108,408 121,959 144,544 162,612 216,816 243,918 325,224 433,632 487,836 650,448 975,672 1,300,896 1,951,344 3,902,688

Collatz Trajectory (97 steps to reach 1)

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

3,902,688 1,951,344 975,672 487,836 243,918 121,959 365,878 182,939 548,818 274,409 823,228 411,614 205,807 617,422 308,711 926,134 463,067 1,389,202 694,601 2,083,804 1,041,902 520,951 1,562,854 781,427 2,344,282 1,172,141 3,516,424 1,758,212 879,106 439,553 1,318,660 659,330 329,665 988,996 494,498 247,249 741,748 370,874 185,437 556,312 278,156 139,078 69,539 208,618 104,309 312,928 156,464 78,232 39,116 19,558 9,779 29,338 14,669 44,008 22,004 11,002 5,501 16,504 8,252 4,126

← Previous Integer #3,902,687 Browse Full Index Next Integer #3,902,689 →