7,943,960

2³ × 5 × 198599

7,943,960 factors as 2^3 × 5 × 198599. Its 16 positive divisors give a proper-divisor sum of 9,930,040, so this integer is abundant. The Collatz stopping time is 93 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 198599

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 17,874,000

Proper Divisor Sum 9,930,040

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #7943951 ← → #7943983

Radix Representation

Decimal	7943960
Binary	11110010011011100011000 (23 bits)
Octal	0o36233430
Hexadecimal	0x793718

Divisor Catalog (16)

1 2 4 5 8 10 20 40 198,599 397,198 794,396 992,995 1,588,792 1,985,990 3,971,980 7,943,960

Collatz Trajectory (93 steps to reach 1)

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

7,943,960 3,971,980 1,985,990 992,995 2,978,986 1,489,493 4,468,480 2,234,240 1,117,120 558,560 279,280 139,640 69,820 34,910 17,455 52,366 26,183 78,550 39,275 117,826 58,913 176,740 88,370 44,185 132,556 66,278 33,139 99,418 49,709 149,128 74,564 37,282 18,641 55,924 27,962 13,981 41,944 20,972 10,486 5,243 15,730 7,865 23,596 11,798 5,899 17,698 8,849 26,548 13,274 6,637 19,912 9,956 4,978 2,489 7,468 3,734 1,867 5,602 2,801 8,404

← Previous Integer #7,943,959 Browse Full Index Next Integer #7,943,961 →