2,149,098

2 × 3 × 7 × 51169

2,149,098 factors as 2 × 3 × 7 × 51169. Its 16 positive divisors give a proper-divisor sum of 2,763,222, so this integer is abundant. The Collatz stopping time is 73 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 51169

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,912,320

Proper Divisor Sum 2,763,222

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2149093 ← → #2149111

Radix Representation

Decimal	2149098
Binary	1000001100101011101010 (22 bits)
Octal	0o10145352
Hexadecimal	0x20CAEA

Divisor Catalog (16)

1 2 3 6 7 14 21 42 51,169 102,338 153,507 307,014 358,183 716,366 1,074,549 2,149,098

Collatz Trajectory (73 steps to reach 1)

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

2,149,098 1,074,549 3,223,648 1,611,824 805,912 402,956 201,478 100,739 302,218 151,109 453,328 226,664 113,332 56,666 28,333 85,000 42,500 21,250 10,625 31,876 15,938 7,969 23,908 11,954 5,977 17,932 8,966 4,483 13,450 6,725 20,176 10,088 5,044 2,522 1,261 3,784 1,892 946 473 1,420 710 355 1,066 533 1,600 800 400 200 100 50 25 76 38 19 58 29 88 44 22 11

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,149,097 Browse Full Index Next Integer #2,149,099 →