5,946,210

2 × 3⁵ × 5 × 2447

5,946,210 factors as 2 × 3^5 × 5 × 2447. Its 48 positive divisors give a proper-divisor sum of 10,093,086, so this integer is abundant. The Collatz stopping time is 152 steps.

Prime Factor Structure

Factorization String 2 × 3^5 × 5 × 2447

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 16,039,296

Proper Divisor Sum 10,093,086

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5946181 ← → #5946217

Radix Representation

Decimal	5946210
Binary	10110101011101101100010 (23 bits)
Octal	0o26535542
Hexadecimal	0x5ABB62

Divisor Catalog (48)

1 2 3 5 6 9 10 15 18 27 30 45 54 81 90 135 162 243 270 405 486 810 1,215 2,430 2,447 4,894 7,341 12,235 14,682 22,023 24,470 36,705 44,046 66,069 73,410 110,115 132,138 198,207 220,230 330,345 396,414 594,621 660,690 991,035 1,189,242 1,982,070 2,973,105 5,946,210

Collatz Trajectory (152 steps to reach 1)

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

5,946,210 2,973,105 8,919,316 4,459,658 2,229,829 6,689,488 3,344,744 1,672,372 836,186 418,093 1,254,280 627,140 313,570 156,785 470,356 235,178 117,589 352,768 176,384 88,192 44,096 22,048 11,024 5,512 2,756 1,378 689 2,068 1,034 517 1,552 776 388 194 97 292 146 73 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182

← Previous Integer #5,946,209 Browse Full Index Next Integer #5,946,211 →