9,654,423

3 × 31 × 103811

9,654,423 factors as 3 × 31 × 103811. Its 8 positive divisors give a proper-divisor sum of 3,633,513, so this integer is deficient. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 3 × 31 × 103811

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,287,936

Proper Divisor Sum 3,633,513

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9654397 ← → #9654433

Radix Representation

Decimal	9654423
Binary	100100110101000010010111 (24 bits)
Octal	0o44650227
Hexadecimal	0x935097

Divisor Catalog (8)

1 3 31 93 103,811 311,433 3,218,141 9,654,423

Collatz Trajectory (163 steps to reach 1)

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

9,654,423 28,963,270 14,481,635 43,444,906 21,722,453 65,167,360 32,583,680 16,291,840 8,145,920 4,072,960 2,036,480 1,018,240 509,120 254,560 127,280 63,640 31,820 15,910 7,955 23,866 11,933 35,800 17,900 8,950 4,475 13,426 6,713 20,140 10,070 5,035 15,106 7,553 22,660 11,330 5,665 16,996 8,498 4,249 12,748 6,374 3,187 9,562 4,781 14,344 7,172 3,586 1,793 5,380 2,690 1,345 4,036 2,018 1,009 3,028 1,514 757 2,272 1,136 568 284

← Previous Integer #9,654,422 Browse Full Index Next Integer #9,654,424 →