4,290,968

2³ × 11 × 48761

4,290,968 factors as 2^3 × 11 × 48761. Its 16 positive divisors give a proper-divisor sum of 4,486,192, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 48761

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,777,160

Proper Divisor Sum 4,486,192

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #4290961 ← → #4290971

Radix Representation

Decimal	4290968
Binary	10000010111100110011000 (23 bits)
Octal	0o20274630
Hexadecimal	0x417998

Divisor Catalog (16)

1 2 4 8 11 22 44 88 48,761 97,522 195,044 390,088 536,371 1,072,742 2,145,484 4,290,968

Collatz Trajectory (74 steps to reach 1)

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

4,290,968 2,145,484 1,072,742 536,371 1,609,114 804,557 2,413,672 1,206,836 603,418 301,709 905,128 452,564 226,282 113,141 339,424 169,712 84,856 42,428 21,214 10,607 31,822 15,911 47,734 23,867 71,602 35,801 107,404 53,702 26,851 80,554 40,277 120,832 60,416 30,208 15,104 7,552 3,776 1,888 944 472 236 118 59 178 89 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,290,967 Browse Full Index Next Integer #4,290,969 →