9,015,495

3 × 5 × 59 × 61 × 167

9,015,495 factors as 3 × 5 × 59 × 61 × 167. Its 32 positive divisors give a proper-divisor sum of 5,983,545, so this integer is deficient. The Collatz stopping time is 287 steps.

Prime Factor Structure

Factorization String 3 × 5 × 59 × 61 × 167

Distinct Prime Factors 5

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 14,999,040

Proper Divisor Sum 5,983,545

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9015467 ← → #9015497

Radix Representation

Decimal	9015495
Binary	100010011001000011000111 (24 bits)
Octal	0o42310307
Hexadecimal	0x8990C7

Divisor Catalog (32)

1 3 5 15 59 61 167 177 183 295 305 501 835 885 915 2,505 3,599 9,853 10,187 10,797 17,995 29,559 30,561 49,265 50,935 53,985 147,795 152,805 601,033 1,803,099 3,005,165 9,015,495

Collatz Trajectory (287 steps to reach 1)

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

9,015,495 27,046,486 13,523,243 40,569,730 20,284,865 60,854,596 30,427,298 15,213,649 45,640,948 22,820,474 11,410,237 34,230,712 17,115,356 8,557,678 4,278,839 12,836,518 6,418,259 19,254,778 9,627,389 28,882,168 14,441,084 7,220,542 3,610,271 10,830,814 5,415,407 16,246,222 8,123,111 24,369,334 12,184,667 36,554,002 18,277,001 54,831,004 27,415,502 13,707,751 41,123,254 20,561,627 61,684,882 30,842,441 92,527,324 46,263,662 23,131,831 69,395,494 34,697,747 104,093,242 52,046,621 156,139,864 78,069,932 39,034,966 19,517,483 58,552,450 29,276,225 87,828,676 43,914,338 21,957,169 65,871,508 32,935,754 16,467,877 49,403,632 24,701,816 12,350,908

← Previous Integer #9,015,494 Browse Full Index Next Integer #9,015,496 →