210,330

2 × 3³ × 5 × 19 × 41

210,330 factors as 2 × 3^3 × 5 × 19 × 41. Its 64 positive divisors give a proper-divisor sum of 394,470, so this integer is abundant. The Collatz stopping time is 49 steps.

Prime Factor Structure

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

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 604,800

Proper Divisor Sum 394,470

Digit Sum / Digital Root 9 (Root: 9)

Adjacent Primes #210323 ← → #210347

Radix Representation

Decimal	210330
Binary	110011010110011010 (18 bits)
Octal	0o632632
Hexadecimal	0x3359A

Divisor Catalog (60 of 64)

1 2 3 5 6 9 10 15 18 19 27 30 38 41 45 54 57 82 90 95 114 123 135 171 190 205 246 270 285 342 369 410 513 570 615 738 779 855 1,026 1,107 1,230 1,558 1,710 1,845 2,214 2,337 2,565 3,690 3,895 4,674 5,130 5,535 7,011 7,790 11,070 11,685 14,022 21,033 23,370 35,055

Collatz Trajectory (49 steps to reach 1)

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

210,330 105,165 315,496 157,748 78,874 39,437 118,312 59,156 29,578 14,789 44,368 22,184 11,092 5,546 2,773 8,320 4,160 2,080 1,040 520 260 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

← Previous Integer #210,329 Browse Full Index Next Integer #210,331 →