2,357,520

2⁴ × 3 × 5 × 11 × 19 × 47

2,357,520 factors as 2^4 × 3 × 5 × 11 × 19 × 47. Its 160 positive divisors give a proper-divisor sum of 6,213,360, so this integer is abundant. The Collatz stopping time is 68 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 5 × 11 × 19 × 47

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 160

Divisor Sum (σ) 8,570,880

Proper Divisor Sum 6,213,360

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2357507 ← → #2357527

Radix Representation

Decimal	2357520
Binary	1000111111100100010000 (22 bits)
Octal	0o10774420
Hexadecimal	0x23F910

Divisor Catalog (60 of 160)

1 2 3 4 5 6 8 10 11 12 15 16 19 20 22 24 30 33 38 40 44 47 48 55 57 60 66 76 80 88 94 95 110 114 120 132 141 152 165 176 188 190 209 220 228 235 240 264 282 285 304 330 376 380 418 440 456 470 517 528

Collatz Trajectory (68 steps to reach 1)

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

2,357,520 1,178,760 589,380 294,690 147,345 442,036 221,018 110,509 331,528 165,764 82,882 41,441 124,324 62,162 31,081 93,244 46,622 23,311 69,934 34,967 104,902 52,451 157,354 78,677 236,032 118,016 59,008 29,504 14,752 7,376 3,688 1,844 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13

← Previous Integer #2,357,519 Browse Full Index Next Integer #2,357,521 →