6,074,310

2 × 3 × 5 × 11 × 79 × 233

6,074,310 factors as 2 × 3 × 5 × 11 × 79 × 233. Its 64 positive divisors give a proper-divisor sum of 10,099,770, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 11 × 79 × 233

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 16,174,080

Proper Divisor Sum 10,099,770

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #6074279 ← → #6074317

Radix Representation

Decimal	6074310
Binary	10111001010111111000110 (23 bits)
Octal	0o27127706
Hexadecimal	0x5CAFC6

Divisor Catalog (60 of 64)

1 2 3 5 6 10 11 15 22 30 33 55 66 79 110 158 165 233 237 330 395 466 474 699 790 869 1,165 1,185 1,398 1,738 2,330 2,370 2,563 2,607 3,495 4,345 5,126 5,214 6,990 7,689 8,690 12,815 13,035 15,378 18,407 25,630 26,070 36,814 38,445 55,221 76,890 92,035 110,442 184,070 202,477 276,105 404,954 552,210 607,431 1,012,385

Collatz Trajectory (121 steps to reach 1)

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

6,074,310 3,037,155 9,111,466 4,555,733 13,667,200 6,833,600 3,416,800 1,708,400 854,200 427,100 213,550 106,775 320,326 160,163 480,490 240,245 720,736 360,368 180,184 90,092 45,046 22,523 67,570 33,785 101,356 50,678 25,339 76,018 38,009 114,028 57,014 28,507 85,522 42,761 128,284 64,142 32,071 96,214 48,107 144,322 72,161 216,484 108,242 54,121 162,364 81,182 40,591 121,774 60,887 182,662 91,331 273,994 136,997 410,992 205,496 102,748 51,374 25,687 77,062 38,531

← Previous Integer #6,074,309 Browse Full Index Next Integer #6,074,311 →