9,000,505

5 × 1013 × 1777

9,000,505 factors as 5 × 1013 × 1777. Its 8 positive divisors give a proper-divisor sum of 1,816,847, so this integer is deficient. The Collatz stopping time is 111 steps.

Prime Factor Structure

Factorization String 5 × 1013 × 1777

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,817,352

Proper Divisor Sum 1,816,847

Digit Sum / Digital Root 19 (Root: 1)

Adjacent Primes #9000499 ← → #9000517

Radix Representation

Decimal	9000505
Binary	100010010101011000111001 (24 bits)
Octal	0o42253071
Hexadecimal	0x895639

Divisor Catalog (8)

1 5 1,013 1,777 5,065 8,885 1,800,101 9,000,505

Collatz Trajectory (111 steps to reach 1)

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

9,000,505 27,001,516 13,500,758 6,750,379 20,251,138 10,125,569 30,376,708 15,188,354 7,594,177 22,782,532 11,391,266 5,695,633 17,086,900 8,543,450 4,271,725 12,815,176 6,407,588 3,203,794 1,601,897 4,805,692 2,402,846 1,201,423 3,604,270 1,802,135 5,406,406 2,703,203 8,109,610 4,054,805 12,164,416 6,082,208 3,041,104 1,520,552 760,276 380,138 190,069 570,208 285,104 142,552 71,276 35,638 17,819 53,458 26,729 80,188 40,094 20,047 60,142 30,071 90,214 45,107 135,322 67,661 202,984 101,492 50,746 25,373 76,120 38,060 19,030 9,515

← Previous Integer #9,000,504 Browse Full Index Next Integer #9,000,506 →