9,025,509

3 × 127 × 23689

9,025,509 factors as 3 × 127 × 23689. Its 8 positive divisors give a proper-divisor sum of 3,103,771, so this integer is deficient. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 3 × 127 × 23689

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,129,280

Proper Divisor Sum 3,103,771

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9025477 ← → #9025517

Radix Representation

Decimal	9025509
Binary	100010011011011111100101 (24 bits)
Octal	0o42333745
Hexadecimal	0x89B7E5

Divisor Catalog (8)

1 3 127 381 23,689 71,067 3,008,503 9,025,509

Collatz Trajectory (181 steps to reach 1)

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

9,025,509 27,076,528 13,538,264 6,769,132 3,384,566 1,692,283 5,076,850 2,538,425 7,615,276 3,807,638 1,903,819 5,711,458 2,855,729 8,567,188 4,283,594 2,141,797 6,425,392 3,212,696 1,606,348 803,174 401,587 1,204,762 602,381 1,807,144 903,572 451,786 225,893 677,680 338,840 169,420 84,710 42,355 127,066 63,533 190,600 95,300 47,650 23,825 71,476 35,738 17,869 53,608 26,804 13,402 6,701 20,104 10,052 5,026 2,513 7,540 3,770 1,885 5,656 2,828 1,414 707 2,122 1,061 3,184 1,592

← Previous Integer #9,025,508 Browse Full Index Next Integer #9,025,510 →