1,690,640

2⁴ × 5 × 7 × 3019

1,690,640 factors as 2^4 × 5 × 7 × 3019. Its 40 positive divisors give a proper-divisor sum of 2,803,120, so this integer is abundant. The Collatz stopping time is 83 steps.

Prime Factor Structure

Factorization String 2^4 × 5 × 7 × 3019

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 4,493,760

Proper Divisor Sum 2,803,120

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #1690621 ← → #1690651

Radix Representation

Decimal	1690640
Binary	110011100110000010000 (21 bits)
Octal	0o6346020
Hexadecimal	0x19CC10

Divisor Catalog (40)

1 2 4 5 7 8 10 14 16 20 28 35 40 56 70 80 112 140 280 560 3,019 6,038 12,076 15,095 21,133 24,152 30,190 42,266 48,304 60,380 84,532 105,665 120,760 169,064 211,330 241,520 338,128 422,660 845,320 1,690,640

Collatz Trajectory (83 steps to reach 1)

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

1,690,640 845,320 422,660 211,330 105,665 316,996 158,498 79,249 237,748 118,874 59,437 178,312 89,156 44,578 22,289 66,868 33,434 16,717 50,152 25,076 12,538 6,269 18,808 9,404 4,702 2,351 7,054 3,527 10,582 5,291 15,874 7,937 23,812 11,906 5,953 17,860 8,930 4,465 13,396 6,698 3,349 10,048 5,024 2,512 1,256 628 314 157 472 236 118 59 178 89 268 134 67 202 101 304

← Previous Integer #1,690,639 Browse Full Index Next Integer #1,690,641 →