2,678,632

2³ × 11 × 61 × 499

2,678,632 factors as 2^3 × 11 × 61 × 499. Its 32 positive divisors give a proper-divisor sum of 2,901,368, so this integer is abundant. The Collatz stopping time is 156 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 61 × 499

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 5,580,000

Proper Divisor Sum 2,901,368

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #2678629 ← → #2678651

Radix Representation

Decimal	2678632
Binary	1010001101111101101000 (22 bits)
Octal	0o12157550
Hexadecimal	0x28DF68

Divisor Catalog (32)

1 2 4 8 11 22 44 61 88 122 244 488 499 671 998 1,342 1,996 2,684 3,992 5,368 5,489 10,978 21,956 30,439 43,912 60,878 121,756 243,512 334,829 669,658 1,339,316 2,678,632

Collatz Trajectory (156 steps to reach 1)

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

2,678,632 1,339,316 669,658 334,829 1,004,488 502,244 251,122 125,561 376,684 188,342 94,171 282,514 141,257 423,772 211,886 105,943 317,830 158,915 476,746 238,373 715,120 357,560 178,780 89,390 44,695 134,086 67,043 201,130 100,565 301,696 150,848 75,424 37,712 18,856 9,428 4,714 2,357 7,072 3,536 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484

← Previous Integer #2,678,631 Browse Full Index Next Integer #2,678,633 →