4,451,607

3² × 601 × 823

4,451,607 factors as 3^2 × 601 × 823. Its 12 positive divisors give a proper-divisor sum of 1,997,017, so this integer is deficient. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 3^2 × 601 × 823

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,448,624

Proper Divisor Sum 1,997,017

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4451599 ← → #4451611

Radix Representation

Decimal	4451607
Binary	10000111110110100010111 (23 bits)
Octal	0o20766427
Hexadecimal	0x43ED17

Divisor Catalog (12)

1 3 9 601 823 1,803 2,469 5,409 7,407 494,623 1,483,869 4,451,607

Collatz Trajectory (87 steps to reach 1)

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

4,451,607 13,354,822 6,677,411 20,032,234 10,016,117 30,048,352 15,024,176 7,512,088 3,756,044 1,878,022 939,011 2,817,034 1,408,517 4,225,552 2,112,776 1,056,388 528,194 264,097 792,292 396,146 198,073 594,220 297,110 148,555 445,666 222,833 668,500 334,250 167,125 501,376 250,688 125,344 62,672 31,336 15,668 7,834 3,917 11,752 5,876 2,938 1,469 4,408 2,204 1,102 551 1,654 827 2,482 1,241 3,724 1,862 931 2,794 1,397 4,192 2,096 1,048 524 262 131

← Previous Integer #4,451,606 Browse Full Index Next Integer #4,451,608 →