2,468,910

2 × 3 × 5 × 17 × 47 × 103

2,468,910 factors as 2 × 3 × 5 × 17 × 47 × 103. Its 64 positive divisors give a proper-divisor sum of 4,000,722, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 17 × 47 × 103

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 6,469,632

Proper Divisor Sum 4,000,722

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2468909 ← → #2468951

Radix Representation

Decimal	2468910
Binary	1001011010110000101110 (22 bits)
Octal	0o11326056
Hexadecimal	0x25AC2E

Divisor Catalog (60 of 64)

1 2 3 5 6 10 15 17 30 34 47 51 85 94 102 103 141 170 206 235 255 282 309 470 510 515 618 705 799 1,030 1,410 1,545 1,598 1,751 2,397 3,090 3,502 3,995 4,794 4,841 5,253 7,990 8,755 9,682 10,506 11,985 14,523 17,510 23,970 24,205 26,265 29,046 48,410 52,530 72,615 82,297 145,230 164,594 246,891 411,485

Collatz Trajectory (81 steps to reach 1)

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

2,468,910 1,234,455 3,703,366 1,851,683 5,555,050 2,777,525 8,332,576 4,166,288 2,083,144 1,041,572 520,786 260,393 781,180 390,590 195,295 585,886 292,943 878,830 439,415 1,318,246 659,123 1,977,370 988,685 2,966,056 1,483,028 741,514 370,757 1,112,272 556,136 278,068 139,034 69,517 208,552 104,276 52,138 26,069 78,208 39,104 19,552 9,776 4,888 2,444 1,222 611 1,834 917 2,752 1,376 688 344 172 86 43 130 65 196 98 49 148 74

← Previous Integer #2,468,909 Browse Full Index Next Integer #2,468,911 →