4,456,578

2 × 3 × 7 × 106109

4,456,578 factors as 2 × 3 × 7 × 106109. Its 16 positive divisors give a proper-divisor sum of 5,729,982, so this integer is abundant. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 106109

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,186,560

Proper Divisor Sum 5,729,982

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4456561 ← → #4456579

Radix Representation

Decimal	4456578
Binary	10001000000000010000010 (23 bits)
Octal	0o21000202
Hexadecimal	0x440082

Divisor Catalog (16)

1 2 3 6 7 14 21 42 106,109 212,218 318,327 636,654 742,763 1,485,526 2,228,289 4,456,578

Collatz Trajectory (87 steps to reach 1)

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

4,456,578 2,228,289 6,684,868 3,342,434 1,671,217 5,013,652 2,506,826 1,253,413 3,760,240 1,880,120 940,060 470,030 235,015 705,046 352,523 1,057,570 528,785 1,586,356 793,178 396,589 1,189,768 594,884 297,442 148,721 446,164 223,082 111,541 334,624 167,312 83,656 41,828 20,914 10,457 31,372 15,686 7,843 23,530 11,765 35,296 17,648 8,824 4,412 2,206 1,103 3,310 1,655 4,966 2,483 7,450 3,725 11,176 5,588 2,794 1,397 4,192 2,096 1,048 524 262 131

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,456,577 Browse Full Index Next Integer #4,456,579 →