6,445,408

2⁵ × 19 × 10601

6,445,408 factors as 2^5 × 19 × 10601. Its 24 positive divisors give a proper-divisor sum of 6,913,112, so this integer is abundant. The Collatz stopping time is 116 steps.

Prime Factor Structure

Factorization String 2^5 × 19 × 10601

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 13,358,520

Proper Divisor Sum 6,913,112

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #6445403 ← → #6445409

Radix Representation

Decimal	6445408
Binary	11000100101100101100000 (23 bits)
Octal	0o30454540
Hexadecimal	0x625960

Divisor Catalog (24)

Collatz Trajectory (116 steps to reach 1)

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

6,445,408 3,222,704 1,611,352 805,676 402,838 201,419 604,258 302,129 906,388 453,194 226,597 679,792 339,896 169,948 84,974 42,487 127,462 63,731 191,194 95,597 286,792 143,396 71,698 35,849 107,548 53,774 26,887 80,662 40,331 120,994 60,497 181,492 90,746 45,373 136,120 68,060 34,030 17,015 51,046 25,523 76,570 38,285 114,856 57,428 28,714 14,357 43,072 21,536 10,768 5,384 2,692 1,346 673 2,020 1,010 505 1,516 758 379 1,138

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,445,407 Browse Full Index Next Integer #6,445,409 →