6,309,408

2⁵ × 3 × 7 × 41 × 229

6,309,408 factors as 2^5 × 3 × 7 × 41 × 229. Its 96 positive divisors give a proper-divisor sum of 13,165,152, so this integer is abundant. The Collatz stopping time is 165 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 7 × 41 × 229

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 19,474,560

Proper Divisor Sum 13,165,152

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6309389 ← → #6309437

Radix Representation

Decimal	6309408
Binary	11000000100011000100000 (23 bits)
Octal	0o30043040
Hexadecimal	0x604620

Divisor Catalog (60 of 96)

1 2 3 4 6 7 8 12 14 16 21 24 28 32 41 42 48 56 82 84 96 112 123 164 168 224 229 246 287 328 336 458 492 574 656 672 687 861 916 984 1,148 1,312 1,374 1,603 1,722 1,832 1,968 2,296 2,748 3,206 3,444 3,664 3,936 4,592 4,809 5,496 6,412 6,888 7,328 9,184

Collatz Trajectory (165 steps to reach 1)

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

6,309,408 3,154,704 1,577,352 788,676 394,338 197,169 591,508 295,754 147,877 443,632 221,816 110,908 55,454 27,727 83,182 41,591 124,774 62,387 187,162 93,581 280,744 140,372 70,186 35,093 105,280 52,640 26,320 13,160 6,580 3,290 1,645 4,936 2,468 1,234 617 1,852 926 463 1,390 695 2,086 1,043 3,130 1,565 4,696 2,348 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31

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