3,103,404

2² × 3 × 258617

3,103,404 factors as 2^2 × 3 × 258617. Its 12 positive divisors give a proper-divisor sum of 4,137,900, so this integer is abundant. The Collatz stopping time is 151 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 258617

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,241,304

Proper Divisor Sum 4,137,900

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #3103393 ← → #3103409

Radix Representation

Decimal	3103404
Binary	1011110101101010101100 (22 bits)
Octal	0o13655254
Hexadecimal	0x2F5AAC

Divisor Catalog (12)

1 2 3 4 6 12 258,617 517,234 775,851 1,034,468 1,551,702 3,103,404

Collatz Trajectory (151 steps to reach 1)

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

3,103,404 1,551,702 775,851 2,327,554 1,163,777 3,491,332 1,745,666 872,833 2,618,500 1,309,250 654,625 1,963,876 981,938 490,969 1,472,908 736,454 368,227 1,104,682 552,341 1,657,024 828,512 414,256 207,128 103,564 51,782 25,891 77,674 38,837 116,512 58,256 29,128 14,564 7,282 3,641 10,924 5,462 2,731 8,194 4,097 12,292 6,146 3,073 9,220 4,610 2,305 6,916 3,458 1,729 5,188 2,594 1,297 3,892 1,946 973 2,920 1,460 730 365 1,096 548

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,103,403 Browse Full Index Next Integer #3,103,405 →