9,480,897

3² × 991 × 1063

9,480,897 factors as 3^2 × 991 × 1063. Its 12 positive divisors give a proper-divisor sum of 4,240,447, so this integer is deficient. The Collatz stopping time is 124 steps.

Prime Factor Structure

Factorization String 3^2 × 991 × 1063

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 13,721,344

Proper Divisor Sum 4,240,447

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #9480893 ← → #9480901

Radix Representation

Decimal	9480897
Binary	100100001010101011000001 (24 bits)
Octal	0o44125301
Hexadecimal	0x90AAC1

Divisor Catalog (12)

1 3 9 991 1,063 2,973 3,189 8,919 9,567 1,053,433 3,160,299 9,480,897

Collatz Trajectory (124 steps to reach 1)

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

9,480,897 28,442,692 14,221,346 7,110,673 21,332,020 10,666,010 5,333,005 15,999,016 7,999,508 3,999,754 1,999,877 5,999,632 2,999,816 1,499,908 749,954 374,977 1,124,932 562,466 281,233 843,700 421,850 210,925 632,776 316,388 158,194 79,097 237,292 118,646 59,323 177,970 88,985 266,956 133,478 66,739 200,218 100,109 300,328 150,164 75,082 37,541 112,624 56,312 28,156 14,078 7,039 21,118 10,559 31,678 15,839 47,518 23,759 71,278 35,639 106,918 53,459 160,378 80,189 240,568 120,284 60,142

← Previous Integer #9,480,896 Browse Full Index Next Integer #9,480,898 →