4,454,634

2 × 3 × 742439

4,454,634 factors as 2 × 3 × 742439. Its 8 positive divisors give a proper-divisor sum of 4,454,646, so this integer is abundant. The Collatz stopping time is 118 steps.

Prime Factor Structure

Factorization String 2 × 3 × 742439

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,909,280

Proper Divisor Sum 4,454,646

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4454621 ← → #4454657

Radix Representation

Decimal	4454634
Binary	10000111111100011101010 (23 bits)
Octal	0o20774352
Hexadecimal	0x43F8EA

Divisor Catalog (8)

1 2 3 6 742,439 1,484,878 2,227,317 4,454,634

Collatz Trajectory (118 steps to reach 1)

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

4,454,634 2,227,317 6,681,952 3,340,976 1,670,488 835,244 417,622 208,811 626,434 313,217 939,652 469,826 234,913 704,740 352,370 176,185 528,556 264,278 132,139 396,418 198,209 594,628 297,314 148,657 445,972 222,986 111,493 334,480 167,240 83,620 41,810 20,905 62,716 31,358 15,679 47,038 23,519 70,558 35,279 105,838 52,919 158,758 79,379 238,138 119,069 357,208 178,604 89,302 44,651 133,954 66,977 200,932 100,466 50,233 150,700 75,350 37,675 113,026 56,513 169,540

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,454,633 Browse Full Index Next Integer #4,454,635 →