10,645,098

2 × 3 × 1774183

10,645,098 factors as 2 × 3 × 1774183. Its 8 positive divisors give a proper-divisor sum of 10,645,110, so this integer is abundant. The Collatz stopping time is 158 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1774183

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 21,290,208

Proper Divisor Sum 10,645,110

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #10645069 ← → #10645127

Radix Representation

Decimal	10645098
Binary	101000100110111001101010 (24 bits)
Octal	0o50467152
Hexadecimal	0xA26E6A

Divisor Catalog (8)

1 2 3 6 1,774,183 3,548,366 5,322,549 10,645,098

Collatz Trajectory (158 steps to reach 1)

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

10,645,098 5,322,549 15,967,648 7,983,824 3,991,912 1,995,956 997,978 498,989 1,496,968 748,484 374,242 187,121 561,364 280,682 140,341 421,024 210,512 105,256 52,628 26,314 13,157 39,472 19,736 9,868 4,934 2,467 7,402 3,701 11,104 5,552 2,776 1,388 694 347 1,042 521 1,564 782 391 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142 71 214 107 322

More profiles

Browse other published profiles and their separate link collections.

Profile #8,342,168 Profile #1,146,956 Profile #9,712,347 Profile #6,573,969 Profile #965,653 Profile #4,620,983 Profile #853,259 Profile #1,288,150

← Previous Integer #10,645,097 Browse Full Index Next Integer #10,645,099 →