2,043,620

2² × 5 × 102181

2,043,620 factors as 2^2 × 5 × 102181. Its 12 positive divisors give a proper-divisor sum of 2,248,024, so this integer is abundant. The Collatz stopping time is 197 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 102181

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,291,644

Proper Divisor Sum 2,248,024

Digit Sum / Digital Root 17 (Root: 8)

Adjacent Primes #2043617 ← → #2043631

Radix Representation

Decimal	2043620
Binary	111110010111011100100 (21 bits)
Octal	0o7627344
Hexadecimal	0x1F2EE4

Divisor Catalog (12)

1 2 4 5 10 20 102,181 204,362 408,724 510,905 1,021,810 2,043,620

Collatz Trajectory (197 steps to reach 1)

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

2,043,620 1,021,810 510,905 1,532,716 766,358 383,179 1,149,538 574,769 1,724,308 862,154 431,077 1,293,232 646,616 323,308 161,654 80,827 242,482 121,241 363,724 181,862 90,931 272,794 136,397 409,192 204,596 102,298 51,149 153,448 76,724 38,362 19,181 57,544 28,772 14,386 7,193 21,580 10,790 5,395 16,186 8,093 24,280 12,140 6,070 3,035 9,106 4,553 13,660 6,830 3,415 10,246 5,123 15,370 7,685 23,056 11,528 5,764 2,882 1,441 4,324 2,162

← Previous Integer #2,043,619 Browse Full Index Next Integer #2,043,621 →