7,981,608

2³ × 3 × 332567

7,981,608 factors as 2^3 × 3 × 332567. Its 16 positive divisors give a proper-divisor sum of 11,972,472, so this integer is abundant. The Collatz stopping time is 230 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 332567

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 19,954,080

Proper Divisor Sum 11,972,472

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #7981591 ← → #7981627

Radix Representation

Decimal	7981608
Binary	11110011100101000101000 (23 bits)
Octal	0o36345050
Hexadecimal	0x79CA28

Divisor Catalog (16)

1 2 3 4 6 8 12 24 332,567 665,134 997,701 1,330,268 1,995,402 2,660,536 3,990,804 7,981,608

Collatz Trajectory (230 steps to reach 1)

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

7,981,608 3,990,804 1,995,402 997,701 2,993,104 1,496,552 748,276 374,138 187,069 561,208 280,604 140,302 70,151 210,454 105,227 315,682 157,841 473,524 236,762 118,381 355,144 177,572 88,786 44,393 133,180 66,590 33,295 99,886 49,943 149,830 74,915 224,746 112,373 337,120 168,560 84,280 42,140 21,070 10,535 31,606 15,803 47,410 23,705 71,116 35,558 17,779 53,338 26,669 80,008 40,004 20,002 10,001 30,004 15,002 7,501 22,504 11,252 5,626 2,813 8,440

← Previous Integer #7,981,607 Browse Full Index Next Integer #7,981,609 →