6,094,698

2 × 3 × 29 × 35027

6,094,698 factors as 2 × 3 × 29 × 35027. Its 16 positive divisors give a proper-divisor sum of 6,515,382, so this integer is abundant. The Collatz stopping time is 227 steps.

Prime Factor Structure

Factorization String 2 × 3 × 29 × 35027

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 12,610,080

Proper Divisor Sum 6,515,382

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #6094657 ← → #6094729

Radix Representation

Decimal	6094698
Binary	10111001111111101101010 (23 bits)
Octal	0o27177552
Hexadecimal	0x5CFF6A

Divisor Catalog (16)

1 2 3 6 29 58 87 174 35,027 70,054 105,081 210,162 1,015,783 2,031,566 3,047,349 6,094,698

Collatz Trajectory (227 steps to reach 1)

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

6,094,698 3,047,349 9,142,048 4,571,024 2,285,512 1,142,756 571,378 285,689 857,068 428,534 214,267 642,802 321,401 964,204 482,102 241,051 723,154 361,577 1,084,732 542,366 271,183 813,550 406,775 1,220,326 610,163 1,830,490 915,245 2,745,736 1,372,868 686,434 343,217 1,029,652 514,826 257,413 772,240 386,120 193,060 96,530 48,265 144,796 72,398 36,199 108,598 54,299 162,898 81,449 244,348 122,174 61,087 183,262 91,631 274,894 137,447 412,342 206,171 618,514 309,257 927,772 463,886 231,943

← Previous Integer #6,094,697 Browse Full Index Next Integer #6,094,699 →