2,194,590

2 × 3 × 5 × 191 × 383

2,194,590 factors as 2 × 3 × 5 × 191 × 383. Its 32 positive divisors give a proper-divisor sum of 3,113,826, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 191 × 383

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 5,308,416

Proper Divisor Sum 3,113,826

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2194579 ← → #2194613

Radix Representation

Decimal	2194590
Binary	1000010111110010011110 (22 bits)
Octal	0o10276236
Hexadecimal	0x217C9E

Divisor Catalog (32)

1 2 3 5 6 10 15 30 191 382 383 573 766 955 1,146 1,149 1,910 1,915 2,298 2,865 3,830 5,730 5,745 11,490 73,153 146,306 219,459 365,765 438,918 731,530 1,097,295 2,194,590

Collatz Trajectory (86 steps to reach 1)

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

2,194,590 1,097,295 3,291,886 1,645,943 4,937,830 2,468,915 7,406,746 3,703,373 11,110,120 5,555,060 2,777,530 1,388,765 4,166,296 2,083,148 1,041,574 520,787 1,562,362 781,181 2,343,544 1,171,772 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

← Previous Integer #2,194,589 Browse Full Index Next Integer #2,194,591 →