9,033,258

2 × 3 × 13 × 115811

9,033,258 factors as 2 × 3 × 13 × 115811. Its 16 positive divisors give a proper-divisor sum of 10,423,158, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 115811

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 19,456,416

Proper Divisor Sum 10,423,158

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9033257 ← → #9033287

Radix Representation

Decimal	9033258
Binary	100010011101011000101010 (24 bits)
Octal	0o42353052
Hexadecimal	0x89D62A

Divisor Catalog (16)

1 2 3 6 13 26 39 78 115,811 231,622 347,433 694,866 1,505,543 3,011,086 4,516,629 9,033,258

Collatz Trajectory (88 steps to reach 1)

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

9,033,258 4,516,629 13,549,888 6,774,944 3,387,472 1,693,736 846,868 423,434 211,717 635,152 317,576 158,788 79,394 39,697 119,092 59,546 29,773 89,320 44,660 22,330 11,165 33,496 16,748 8,374 4,187 12,562 6,281 18,844 9,422 4,711 14,134 7,067 21,202 10,601 31,804 15,902 7,951 23,854 11,927 35,782 17,891 53,674 26,837 80,512 40,256 20,128 10,064 5,032 2,516 1,258 629 1,888 944 472 236 118 59 178 89 268

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,033,257 Browse Full Index Next Integer #9,033,259 →