3,062,666

2 × 1531333

3,062,666 factors as 2 × 1531333. Its 4 positive divisors give a proper-divisor sum of 1,531,336, so this integer is deficient. The Collatz stopping time is 151 steps.

Prime Factor Structure

Factorization String 2 × 1531333

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 4,594,002

Proper Divisor Sum 1,531,336

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #3062663 ← → #3062671

Radix Representation

Decimal	3062666
Binary	1011101011101110001010 (22 bits)
Octal	0o13535612
Hexadecimal	0x2EBB8A

Divisor Catalog (4)

1 2 1,531,333 3,062,666

Collatz Trajectory (151 steps to reach 1)

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

3,062,666 1,531,333 4,594,000 2,297,000 1,148,500 574,250 287,125 861,376 430,688 215,344 107,672 53,836 26,918 13,459 40,378 20,189 60,568 30,284 15,142 7,571 22,714 11,357 34,072 17,036 8,518 4,259 12,778 6,389 19,168 9,584 4,792 2,396 1,198 599 1,798 899 2,698 1,349 4,048 2,024 1,012 506 253 760 380 190 95 286 143 430 215 646 323 970 485 1,456 728 364 182 91

← Previous Integer #3,062,665 Browse Full Index Next Integer #3,062,667 →