968,412

2² × 3 × 80701

968,412 factors as 2^2 × 3 × 80701. Its 12 positive divisors give a proper-divisor sum of 1,291,244, so this integer is abundant. The Collatz stopping time is 170 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 80701

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,259,656

Proper Divisor Sum 1,291,244

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #968389 ← → #968419

Radix Representation

Decimal	968412
Binary	11101100011011011100 (20 bits)
Octal	0o3543334
Hexadecimal	0xEC6DC

Divisor Catalog (12)

1 2 3 4 6 12 80,701 161,402 242,103 322,804 484,206 968,412

Collatz Trajectory (170 steps to reach 1)

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

968,412 484,206 242,103 726,310 363,155 1,089,466 544,733 1,634,200 817,100 408,550 204,275 612,826 306,413 919,240 459,620 229,810 114,905 344,716 172,358 86,179 258,538 129,269 387,808 193,904 96,952 48,476 24,238 12,119 36,358 18,179 54,538 27,269 81,808 40,904 20,452 10,226 5,113 15,340 7,670 3,835 11,506 5,753 17,260 8,630 4,315 12,946 6,473 19,420 9,710 4,855 14,566 7,283 21,850 10,925 32,776 16,388 8,194 4,097 12,292 6,146

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #968,411 Browse Full Index Next Integer #968,413 →