6,303,060

2² × 3² × 5 × 19² × 97

6,303,060 factors as 2^2 × 3^2 × 5 × 19^2 × 97. Its 108 positive divisors give a proper-divisor sum of 14,083,488, so this integer is abundant. The Collatz stopping time is 165 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 5 × 19^2 × 97

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 108

Divisor Sum (σ) 20,386,548

Proper Divisor Sum 14,083,488

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #6303043 ← → #6303071

Radix Representation

Decimal	6303060
Binary	11000000010110101010100 (23 bits)
Octal	0o30026524
Hexadecimal	0x602D54

Divisor Catalog (60 of 108)

1 2 3 4 5 6 9 10 12 15 18 19 20 30 36 38 45 57 60 76 90 95 97 114 171 180 190 194 228 285 291 342 361 380 388 485 570 582 684 722 855 873 970 1,083 1,140 1,164 1,444 1,455 1,710 1,746 1,805 1,843 1,940 2,166 2,910 3,249 3,420 3,492 3,610 3,686

Collatz Trajectory (165 steps to reach 1)

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

6,303,060 3,151,530 1,575,765 4,727,296 2,363,648 1,181,824 590,912 295,456 147,728 73,864 36,932 18,466 9,233 27,700 13,850 6,925 20,776 10,388 5,194 2,597 7,792 3,896 1,948 974 487 1,462 731 2,194 1,097 3,292 1,646 823 2,470 1,235 3,706 1,853 5,560 2,780 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,303,059 Browse Full Index Next Integer #6,303,061 →