3,095,016

2³ × 3 × 128959

3,095,016 factors as 2^3 × 3 × 128959. Its 16 positive divisors give a proper-divisor sum of 4,642,584, so this integer is abundant. The Collatz stopping time is 133 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 128959

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,737,600

Proper Divisor Sum 4,642,584

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3094991 ← → #3095063

Radix Representation

Decimal	3095016
Binary	1011110011100111101000 (22 bits)
Octal	0o13634750
Hexadecimal	0x2F39E8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 128,959 257,918 386,877 515,836 773,754 1,031,672 1,547,508 3,095,016

Collatz Trajectory (133 steps to reach 1)

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

3,095,016 1,547,508 773,754 386,877 1,160,632 580,316 290,158 145,079 435,238 217,619 652,858 326,429 979,288 489,644 244,822 122,411 367,234 183,617 550,852 275,426 137,713 413,140 206,570 103,285 309,856 154,928 77,464 38,732 19,366 9,683 29,050 14,525 43,576 21,788 10,894 5,447 16,342 8,171 24,514 12,257 36,772 18,386 9,193 27,580 13,790 6,895 20,686 10,343 31,030 15,515 46,546 23,273 69,820 34,910 17,455 52,366 26,183 78,550 39,275 117,826

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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