1,210,062

2 × 3 × 7 × 47 × 613

1,210,062 factors as 2 × 3 × 7 × 47 × 613. Its 32 positive divisors give a proper-divisor sum of 1,619,250, so this integer is abundant. The Collatz stopping time is 235 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 47 × 613

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 2,829,312

Proper Divisor Sum 1,619,250

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #1210051 ← → #1210067

Radix Representation

Decimal	1210062
Binary	100100111011011001110 (21 bits)
Octal	0o4473316
Hexadecimal	0x1276CE

Divisor Catalog (32)

1 2 3 6 7 14 21 42 47 94 141 282 329 613 658 987 1,226 1,839 1,974 3,678 4,291 8,582 12,873 25,746 28,811 57,622 86,433 172,866 201,677 403,354 605,031 1,210,062

Collatz Trajectory (235 steps to reach 1)

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

1,210,062 605,031 1,815,094 907,547 2,722,642 1,361,321 4,083,964 2,041,982 1,020,991 3,062,974 1,531,487 4,594,462 2,297,231 6,891,694 3,445,847 10,337,542 5,168,771 15,506,314 7,753,157 23,259,472 11,629,736 5,814,868 2,907,434 1,453,717 4,361,152 2,180,576 1,090,288 545,144 272,572 136,286 68,143 204,430 102,215 306,646 153,323 459,970 229,985 689,956 344,978 172,489 517,468 258,734 129,367 388,102 194,051 582,154 291,077 873,232 436,616 218,308 109,154 54,577 163,732 81,866 40,933 122,800 61,400 30,700 15,350 7,675

← Previous Integer #1,210,061 Browse Full Index Next Integer #1,210,063 →