9,151,203

3 × 3050401

9,151,203 factors as 3 × 3050401. Its 4 positive divisors give a proper-divisor sum of 3,050,405, so this integer is deficient. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 3 × 3050401

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 12,201,608

Proper Divisor Sum 3,050,405

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #9151201 ← → #9151213

Radix Representation

Decimal	9151203
Binary	100010111010001011100011 (24 bits)
Octal	0o42721343
Hexadecimal	0x8BA2E3

Divisor Catalog (4)

1 3 3,050,401 9,151,203

Collatz Trajectory (132 steps to reach 1)

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

9,151,203 27,453,610 13,726,805 41,180,416 20,590,208 10,295,104 5,147,552 2,573,776 1,286,888 643,444 321,722 160,861 482,584 241,292 120,646 60,323 180,970 90,485 271,456 135,728 67,864 33,932 16,966 8,483 25,450 12,725 38,176 19,088 9,544 4,772 2,386 1,193 3,580 1,790 895 2,686 1,343 4,030 2,015 6,046 3,023 9,070 4,535 13,606 6,803 20,410 10,205 30,616 15,308 7,654 3,827 11,482 5,741 17,224 8,612 4,306 2,153 6,460 3,230 1,615

← Previous Integer #9,151,202 Browse Full Index Next Integer #9,151,204 →