2,051,053

31 × 109 × 607

2,051,053 factors as 31 × 109 × 607. Its 8 positive divisors give a proper-divisor sum of 89,107, so this integer is deficient. The Collatz stopping time is 78 steps.

Prime Factor Structure

Factorization String 31 × 109 × 607

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,140,160

Proper Divisor Sum 89,107

Digit Sum / Digital Root 16 (Root: 7)

Adjacent Primes #2051051 ← → #2051059

Radix Representation

Decimal	2051053
Binary	111110100101111101101 (21 bits)
Octal	0o7645755
Hexadecimal	0x1F4BED

Divisor Catalog (8)

1 31 109 607 3,379 18,817 66,163 2,051,053

Collatz Trajectory (78 steps to reach 1)

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

2,051,053 6,153,160 3,076,580 1,538,290 769,145 2,307,436 1,153,718 576,859 1,730,578 865,289 2,595,868 1,297,934 648,967 1,946,902 973,451 2,920,354 1,460,177 4,380,532 2,190,266 1,095,133 3,285,400 1,642,700 821,350 410,675 1,232,026 616,013 1,848,040 924,020 462,010 231,005 693,016 346,508 173,254 86,627 259,882 129,941 389,824 194,912 97,456 48,728 24,364 12,182 6,091 18,274 9,137 27,412 13,706 6,853 20,560 10,280 5,140 2,570 1,285 3,856 1,928 964 482 241 724 362

← Previous Integer #2,051,052 Browse Full Index Next Integer #2,051,054 →