7,883,178

2 × 3 × 1313863

7,883,178 factors as 2 × 3 × 1313863. Its 8 positive divisors give a proper-divisor sum of 7,883,190, so this integer is abundant. The Collatz stopping time is 186 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1313863

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 15,766,368

Proper Divisor Sum 7,883,190

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #7883177 ← → #7883191

Radix Representation

Decimal	7883178
Binary	11110000100100110101010 (23 bits)
Octal	0o36044652
Hexadecimal	0x7849AA

Divisor Catalog (8)

1 2 3 6 1,313,863 2,627,726 3,941,589 7,883,178

Collatz Trajectory (186 steps to reach 1)

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

7,883,178 3,941,589 11,824,768 5,912,384 2,956,192 1,478,096 739,048 369,524 184,762 92,381 277,144 138,572 69,286 34,643 103,930 51,965 155,896 77,948 38,974 19,487 58,462 29,231 87,694 43,847 131,542 65,771 197,314 98,657 295,972 147,986 73,993 221,980 110,990 55,495 166,486 83,243 249,730 124,865 374,596 187,298 93,649 280,948 140,474 70,237 210,712 105,356 52,678 26,339 79,018 39,509 118,528 59,264 29,632 14,816 7,408 3,704 1,852 926 463 1,390

← Previous Integer #7,883,177 Browse Full Index Next Integer #7,883,179 →