2,010,980

2² × 5 × 100549

2,010,980 factors as 2^2 × 5 × 100549. Its 12 positive divisors give a proper-divisor sum of 2,212,120, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 100549

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,223,100

Proper Divisor Sum 2,212,120

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #2010977 ← → #2011003

Radix Representation

Decimal	2010980
Binary	111101010111101100100 (21 bits)
Octal	0o7527544
Hexadecimal	0x1EAF64

Divisor Catalog (12)

1 2 4 5 10 20 100,549 201,098 402,196 502,745 1,005,490 2,010,980

Collatz Trajectory (91 steps to reach 1)

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

2,010,980 1,005,490 502,745 1,508,236 754,118 377,059 1,131,178 565,589 1,696,768 848,384 424,192 212,096 106,048 53,024 26,512 13,256 6,628 3,314 1,657 4,972 2,486 1,243 3,730 1,865 5,596 2,798 1,399 4,198 2,099 6,298 3,149 9,448 4,724 2,362 1,181 3,544 1,772 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211 634 317 952 476 238 119 358

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,010,979 Browse Full Index Next Integer #2,010,981 →