7,104,714

2 × 3 × 1184119

7,104,714 factors as 2 × 3 × 1184119. Its 8 positive divisors give a proper-divisor sum of 7,104,726, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1184119

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 14,209,440

Proper Divisor Sum 7,104,726

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #7104709 ← → #7104719

Radix Representation

Decimal	7104714
Binary	11011000110100011001010 (23 bits)
Octal	0o33064312
Hexadecimal	0x6C68CA

Divisor Catalog (8)

1 2 3 6 1,184,119 2,368,238 3,552,357 7,104,714

Collatz Trajectory (121 steps to reach 1)

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

7,104,714 3,552,357 10,657,072 5,328,536 2,664,268 1,332,134 666,067 1,998,202 999,101 2,997,304 1,498,652 749,326 374,663 1,123,990 561,995 1,685,986 842,993 2,528,980 1,264,490 632,245 1,896,736 948,368 474,184 237,092 118,546 59,273 177,820 88,910 44,455 133,366 66,683 200,050 100,025 300,076 150,038 75,019 225,058 112,529 337,588 168,794 84,397 253,192 126,596 63,298 31,649 94,948 47,474 23,737 71,212 35,606 17,803 53,410 26,705 80,116 40,058 20,029 60,088 30,044 15,022 7,511

← Previous Integer #7,104,713 Browse Full Index Next Integer #7,104,715 →