1,498,116

2² × 3 × 131 × 953

1,498,116 factors as 2^2 × 3 × 131 × 953. Its 24 positive divisors give a proper-divisor sum of 2,027,868, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 131 × 953

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 3,525,984

Proper Divisor Sum 2,027,868

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1498097 ← → #1498121

Radix Representation

Decimal	1498116
Binary	101101101110000000100 (21 bits)
Octal	0o5556004
Hexadecimal	0x16DC04

Divisor Catalog (24)

1 2 3 4 6 12 131 262 393 524 786 953 1,572 1,906 2,859 3,812 5,718 11,436 124,843 249,686 374,529 499,372 749,058 1,498,116

Collatz Trajectory (150 steps to reach 1)

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

1,498,116 749,058 374,529 1,123,588 561,794 280,897 842,692 421,346 210,673 632,020 316,010 158,005 474,016 237,008 118,504 59,252 29,626 14,813 44,440 22,220 11,110 5,555 16,666 8,333 25,000 12,500 6,250 3,125 9,376 4,688 2,344 1,172 586 293 880 440 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274

← Previous Integer #1,498,115 Browse Full Index Next Integer #1,498,117 →