3,073,566

2 × 3 × 17 × 30133

3,073,566 factors as 2 × 3 × 17 × 30133. Its 16 positive divisors give a proper-divisor sum of 3,435,378, so this integer is abundant. The Collatz stopping time is 151 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17 × 30133

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,508,944

Proper Divisor Sum 3,435,378

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3073547 ← → #3073579

Radix Representation

Decimal	3073566
Binary	1011101110011000011110 (22 bits)
Octal	0o13563036
Hexadecimal	0x2EE61E

Divisor Catalog (16)

1 2 3 6 17 34 51 102 30,133 60,266 90,399 180,798 512,261 1,024,522 1,536,783 3,073,566

Collatz Trajectory (151 steps to reach 1)

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

3,073,566 1,536,783 4,610,350 2,305,175 6,915,526 3,457,763 10,373,290 5,186,645 15,559,936 7,779,968 3,889,984 1,944,992 972,496 486,248 243,124 121,562 60,781 182,344 91,172 45,586 22,793 68,380 34,190 17,095 51,286 25,643 76,930 38,465 115,396 57,698 28,849 86,548 43,274 21,637 64,912 32,456 16,228 8,114 4,057 12,172 6,086 3,043 9,130 4,565 13,696 6,848 3,424 1,712 856 428 214 107 322 161 484 242 121 364 182 91

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,073,565 Browse Full Index Next Integer #3,073,567 →