9,564,204

2² × 3 × 13 × 37 × 1657

9,564,204 factors as 2^2 × 3 × 13 × 37 × 1657. Its 48 positive divisors give a proper-divisor sum of 15,133,364, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 13 × 37 × 1657

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 24,697,568

Proper Divisor Sum 15,133,364

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9564199 ← → #9564211

Radix Representation

Decimal	9564204
Binary	100100011111000000101100 (24 bits)
Octal	0o44370054
Hexadecimal	0x91F02C

Divisor Catalog (48)

1 2 3 4 6 12 13 26 37 39 52 74 78 111 148 156 222 444 481 962 1,443 1,657 1,924 2,886 3,314 4,971 5,772 6,628 9,942 19,884 21,541 43,082 61,309 64,623 86,164 122,618 129,246 183,927 245,236 258,492 367,854 735,708 797,017 1,594,034 2,391,051 3,188,068 4,782,102 9,564,204

Collatz Trajectory (163 steps to reach 1)

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

9,564,204 4,782,102 2,391,051 7,173,154 3,586,577 10,759,732 5,379,866 2,689,933 8,069,800 4,034,900 2,017,450 1,008,725 3,026,176 1,513,088 756,544 378,272 189,136 94,568 47,284 23,642 11,821 35,464 17,732 8,866 4,433 13,300 6,650 3,325 9,976 4,988 2,494 1,247 3,742 1,871 5,614 2,807 8,422 4,211 12,634 6,317 18,952 9,476 4,738 2,369 7,108 3,554 1,777 5,332 2,666 1,333 4,000 2,000 1,000 500 250 125 376 188 94 47

← Previous Integer #9,564,203 Browse Full Index Next Integer #9,564,205 →