4,621,254

2 × 3 × 11 × 70019

4,621,254 factors as 2 × 3 × 11 × 70019. Its 16 positive divisors give a proper-divisor sum of 5,461,626, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 70019

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,082,880

Proper Divisor Sum 5,461,626

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4621231 ← → #4621259

Radix Representation

Decimal	4621254
Binary	10001101000001111000110 (23 bits)
Octal	0o21501706
Hexadecimal	0x4683C6

Divisor Catalog (16)

1 2 3 6 11 22 33 66 70,019 140,038 210,057 420,114 770,209 1,540,418 2,310,627 4,621,254

Collatz Trajectory (74 steps to reach 1)

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

4,621,254 2,310,627 6,931,882 3,465,941 10,397,824 5,198,912 2,599,456 1,299,728 649,864 324,932 162,466 81,233 243,700 121,850 60,925 182,776 91,388 45,694 22,847 68,542 34,271 102,814 51,407 154,222 77,111 231,334 115,667 347,002 173,501 520,504 260,252 130,126 65,063 195,190 97,595 292,786 146,393 439,180 219,590 109,795 329,386 164,693 494,080 247,040 123,520 61,760 30,880 15,440 7,720 3,860 1,930 965 2,896 1,448 724 362 181 544 272 136

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,621,253 Browse Full Index Next Integer #4,621,255 →