9,520,068

2² × 3 × 17 × 23 × 2029

9,520,068 factors as 2^2 × 3 × 17 × 23 × 2029. Its 48 positive divisors give a proper-divisor sum of 15,034,812, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 17 × 23 × 2029

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 24,554,880

Proper Divisor Sum 15,034,812

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9520067 ← → #9520081

Radix Representation

Decimal	9520068
Binary	100100010100001111000100 (24 bits)
Octal	0o44241704
Hexadecimal	0x9143C4

Divisor Catalog (48)

1 2 3 4 6 12 17 23 34 46 51 68 69 92 102 138 204 276 391 782 1,173 1,564 2,029 2,346 4,058 4,692 6,087 8,116 12,174 24,348 34,493 46,667 68,986 93,334 103,479 137,972 140,001 186,668 206,958 280,002 413,916 560,004 793,339 1,586,678 2,380,017 3,173,356 4,760,034 9,520,068

Collatz Trajectory (163 steps to reach 1)

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

9,520,068 4,760,034 2,380,017 7,140,052 3,570,026 1,785,013 5,355,040 2,677,520 1,338,760 669,380 334,690 167,345 502,036 251,018 125,509 376,528 188,264 94,132 47,066 23,533 70,600 35,300 17,650 8,825 26,476 13,238 6,619 19,858 9,929 29,788 14,894 7,447 22,342 11,171 33,514 16,757 50,272 25,136 12,568 6,284 3,142 1,571 4,714 2,357 7,072 3,536 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47

← Previous Integer #9,520,067 Browse Full Index Next Integer #9,520,069 →