9,150,232

2³ × 7 × 13 × 12569

9,150,232 factors as 2^3 × 7 × 13 × 12569. Its 32 positive divisors give a proper-divisor sum of 11,967,368, so this integer is abundant. The Collatz stopping time is 119 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 13 × 12569

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 21,117,600

Proper Divisor Sum 11,967,368

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #9150227 ← → #9150241

Radix Representation

Decimal	9150232
Binary	100010111001111100011000 (24 bits)
Octal	0o42717430
Hexadecimal	0x8B9F18

Divisor Catalog (32)

Collatz Trajectory (119 steps to reach 1)

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

9,150,232 4,575,116 2,287,558 1,143,779 3,431,338 1,715,669 5,147,008 2,573,504 1,286,752 643,376 321,688 160,844 80,422 40,211 120,634 60,317 180,952 90,476 45,238 22,619 67,858 33,929 101,788 50,894 25,447 76,342 38,171 114,514 57,257 171,772 85,886 42,943 128,830 64,415 193,246 96,623 289,870 144,935 434,806 217,403 652,210 326,105 978,316 489,158 244,579 733,738 366,869 1,100,608 550,304 275,152 137,576 68,788 34,394 17,197 51,592 25,796 12,898 6,449 19,348 9,674

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,150,231 Browse Full Index Next Integer #9,150,233 →