2,387,610

2 × 3³ × 5 × 37 × 239

2,387,610 factors as 2 × 3^3 × 5 × 37 × 239. Its 64 positive divisors give a proper-divisor sum of 4,178,790, so this integer is abundant. The Collatz stopping time is 99 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 5 × 37 × 239

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 6,566,400

Proper Divisor Sum 4,178,790

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2387591 ← → #2387621

Radix Representation

Decimal	2387610
Binary	1001000110111010011010 (22 bits)
Octal	0o11067232
Hexadecimal	0x246E9A

Divisor Catalog (60 of 64)

1 2 3 5 6 9 10 15 18 27 30 37 45 54 74 90 111 135 185 222 239 270 333 370 478 555 666 717 999 1,110 1,195 1,434 1,665 1,998 2,151 2,390 3,330 3,585 4,302 4,995 6,453 7,170 8,843 9,990 10,755 12,906 17,686 21,510 26,529 32,265 44,215 53,058 64,530 79,587 88,430 132,645 159,174 238,761 265,290 397,935

Collatz Trajectory (99 steps to reach 1)

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

2,387,610 1,193,805 3,581,416 1,790,708 895,354 447,677 1,343,032 671,516 335,758 167,879 503,638 251,819 755,458 377,729 1,133,188 566,594 283,297 849,892 424,946 212,473 637,420 318,710 159,355 478,066 239,033 717,100 358,550 179,275 537,826 268,913 806,740 403,370 201,685 605,056 302,528 151,264 75,632 37,816 18,908 9,454 4,727 14,182 7,091 21,274 10,637 31,912 15,956 7,978 3,989 11,968 5,984 2,992 1,496 748 374 187 562 281 844 422

← Previous Integer #2,387,609 Browse Full Index Next Integer #2,387,611 →