5,796,078

2 × 3 × 966013

5,796,078 factors as 2 × 3 × 966013. Its 8 positive divisors give a proper-divisor sum of 5,796,090, so this integer is abundant. The Collatz stopping time is 245 steps.

Prime Factor Structure

Factorization String 2 × 3 × 966013

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 11,592,168

Proper Divisor Sum 5,796,090

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #5796073 ← → #5796097

Radix Representation

Decimal	5796078
Binary	10110000111000011101110 (23 bits)
Octal	0o26070356
Hexadecimal	0x5870EE

Divisor Catalog (8)

1 2 3 6 966,013 1,932,026 2,898,039 5,796,078

Collatz Trajectory (245 steps to reach 1)

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

5,796,078 2,898,039 8,694,118 4,347,059 13,041,178 6,520,589 19,561,768 9,780,884 4,890,442 2,445,221 7,335,664 3,667,832 1,833,916 916,958 458,479 1,375,438 687,719 2,063,158 1,031,579 3,094,738 1,547,369 4,642,108 2,321,054 1,160,527 3,481,582 1,740,791 5,222,374 2,611,187 7,833,562 3,916,781 11,750,344 5,875,172 2,937,586 1,468,793 4,406,380 2,203,190 1,101,595 3,304,786 1,652,393 4,957,180 2,478,590 1,239,295 3,717,886 1,858,943 5,576,830 2,788,415 8,365,246 4,182,623 12,547,870 6,273,935 18,821,806 9,410,903 28,232,710 14,116,355 42,349,066 21,174,533 63,523,600 31,761,800 15,880,900 7,940,450

← Previous Integer #5,796,077 Browse Full Index Next Integer #5,796,079 →