3,095,210

2 × 5 × 309521

3,095,210 factors as 2 × 5 × 309521. Its 8 positive divisors give a proper-divisor sum of 2,476,186, so this integer is deficient. The Collatz stopping time is 102 steps.

Prime Factor Structure

Factorization String 2 × 5 × 309521

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,571,396

Proper Divisor Sum 2,476,186

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #3095203 ← → #3095221

Radix Representation

Decimal	3095210
Binary	1011110011101010101010 (22 bits)
Octal	0o13635252
Hexadecimal	0x2F3AAA

Divisor Catalog (8)

1 2 5 10 309,521 619,042 1,547,605 3,095,210

Collatz Trajectory (102 steps to reach 1)

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

3,095,210 1,547,605 4,642,816 2,321,408 1,160,704 580,352 290,176 145,088 72,544 36,272 18,136 9,068 4,534 2,267 6,802 3,401 10,204 5,102 2,551 7,654 3,827 11,482 5,741 17,224 8,612 4,306 2,153 6,460 3,230 1,615 4,846 2,423 7,270 3,635 10,906 5,453 16,360 8,180 4,090 2,045 6,136 3,068 1,534 767 2,302 1,151 3,454 1,727 5,182 2,591 7,774 3,887 11,662 5,831 17,494 8,747 26,242 13,121 39,364 19,682

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,095,209 Browse Full Index Next Integer #3,095,211 →