9,251,123

7 × 1321589

9,251,123 factors as 7 × 1321589. Its 4 positive divisors give a proper-divisor sum of 1,321,597, so this integer is deficient. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 7 × 1321589

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 10,572,720

Proper Divisor Sum 1,321,597

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #9251059 ← → #9251161

Radix Representation

Decimal	9251123
Binary	100011010010100100110011 (24 bits)
Octal	0o43224463
Hexadecimal	0x8D2933

Divisor Catalog (4)

1 7 1,321,589 9,251,123

Collatz Trajectory (150 steps to reach 1)

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

9,251,123 27,753,370 13,876,685 41,630,056 20,815,028 10,407,514 5,203,757 15,611,272 7,805,636 3,902,818 1,951,409 5,854,228 2,927,114 1,463,557 4,390,672 2,195,336 1,097,668 548,834 274,417 823,252 411,626 205,813 617,440 308,720 154,360 77,180 38,590 19,295 57,886 28,943 86,830 43,415 130,246 65,123 195,370 97,685 293,056 146,528 73,264 36,632 18,316 9,158 4,579 13,738 6,869 20,608 10,304 5,152 2,576 1,288 644 322 161 484 242 121 364 182 91 274

← Previous Integer #9,251,122 Browse Full Index Next Integer #9,251,124 →