3,915,016

2³ × 7 × 69911

3,915,016 factors as 2^3 × 7 × 69911. Its 16 positive divisors give a proper-divisor sum of 4,474,424, so this integer is abundant. The Collatz stopping time is 141 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 69911

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,389,440

Proper Divisor Sum 4,474,424

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #3915013 ← → #3915031

Radix Representation

Decimal	3915016
Binary	1110111011110100001000 (22 bits)
Octal	0o16736410
Hexadecimal	0x3BBD08

Divisor Catalog (16)

1 2 4 7 8 14 28 56 69,911 139,822 279,644 489,377 559,288 978,754 1,957,508 3,915,016

Collatz Trajectory (141 steps to reach 1)

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

3,915,016 1,957,508 978,754 489,377 1,468,132 734,066 367,033 1,101,100 550,550 275,275 825,826 412,913 1,238,740 619,370 309,685 929,056 464,528 232,264 116,132 58,066 29,033 87,100 43,550 21,775 65,326 32,663 97,990 48,995 146,986 73,493 220,480 110,240 55,120 27,560 13,780 6,890 3,445 10,336 5,168 2,584 1,292 646 323 970 485 1,456 728 364 182 91 274 137 412 206 103 310 155 466 233 700

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,915,015 Browse Full Index Next Integer #3,915,017 →