9,992,514

2 × 3 × 7 × 53 × 67²

9,992,514 factors as 2 × 3 × 7 × 53 × 67^2. Its 48 positive divisors give a proper-divisor sum of 13,630,974, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 53 × 67^2

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 23,623,488

Proper Divisor Sum 13,630,974

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9992497 ← → #9992531

Radix Representation

Decimal	9992514
Binary	100110000111100101000010 (24 bits)
Octal	0o46074502
Hexadecimal	0x987942

Divisor Catalog (48)

1 2 3 6 7 14 21 42 53 67 106 134 159 201 318 371 402 469 742 938 1,113 1,407 2,226 2,814 3,551 4,489 7,102 8,978 10,653 13,467 21,306 24,857 26,934 31,423 49,714 62,846 74,571 94,269 149,142 188,538 237,917 475,834 713,751 1,427,502 1,665,419 3,330,838 4,996,257 9,992,514

Collatz Trajectory (114 steps to reach 1)

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

9,992,514 4,996,257 14,988,772 7,494,386 3,747,193 11,241,580 5,620,790 2,810,395 8,431,186 4,215,593 12,646,780 6,323,390 3,161,695 9,485,086 4,742,543 14,227,630 7,113,815 21,341,446 10,670,723 32,012,170 16,006,085 48,018,256 24,009,128 12,004,564 6,002,282 3,001,141 9,003,424 4,501,712 2,250,856 1,125,428 562,714 281,357 844,072 422,036 211,018 105,509 316,528 158,264 79,132 39,566 19,783 59,350 29,675 89,026 44,513 133,540 66,770 33,385 100,156 50,078 25,039 75,118 37,559 112,678 56,339 169,018 84,509 253,528 126,764 63,382

← Previous Integer #9,992,513 Browse Full Index Next Integer #9,992,515 →