4,688,012

2² × 7 × 167429

4,688,012 factors as 2^2 × 7 × 167429. Its 12 positive divisors give a proper-divisor sum of 4,688,068, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 167429

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,376,080

Proper Divisor Sum 4,688,068

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #4687999 ← → #4688017

Radix Representation

Decimal	4688012
Binary	10001111000100010001100 (23 bits)
Octal	0o21704214
Hexadecimal	0x47888C

Divisor Catalog (12)

1 2 4 7 14 28 167,429 334,858 669,716 1,172,003 2,344,006 4,688,012

Collatz Trajectory (74 steps to reach 1)

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

4,688,012 2,344,006 1,172,003 3,516,010 1,758,005 5,274,016 2,637,008 1,318,504 659,252 329,626 164,813 494,440 247,220 123,610 61,805 185,416 92,708 46,354 23,177 69,532 34,766 17,383 52,150 26,075 78,226 39,113 117,340 58,670 29,335 88,006 44,003 132,010 66,005 198,016 99,008 49,504 24,752 12,376 6,188 3,094 1,547 4,642 2,321 6,964 3,482 1,741 5,224 2,612 1,306 653 1,960 980 490 245 736 368 184 92 46 23

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,688,011 Browse Full Index Next Integer #4,688,013 →