2,227,686

2 × 3 × 371281

2,227,686 factors as 2 × 3 × 371281. Its 8 positive divisors give a proper-divisor sum of 2,227,698, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2 × 3 × 371281

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,455,384

Proper Divisor Sum 2,227,698

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2227669 ← → #2227717

Radix Representation

Decimal	2227686
Binary	1000011111110111100110 (22 bits)
Octal	0o10376746
Hexadecimal	0x21FDE6

Divisor Catalog (8)

1 2 3 6 371,281 742,562 1,113,843 2,227,686

Collatz Trajectory (86 steps to reach 1)

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

2,227,686 1,113,843 3,341,530 1,670,765 5,012,296 2,506,148 1,253,074 626,537 1,879,612 939,806 469,903 1,409,710 704,855 2,114,566 1,057,283 3,171,850 1,585,925 4,757,776 2,378,888 1,189,444 594,722 297,361 892,084 446,042 223,021 669,064 334,532 167,266 83,633 250,900 125,450 62,725 188,176 94,088 47,044 23,522 11,761 35,284 17,642 8,821 26,464 13,232 6,616 3,308 1,654 827 2,482 1,241 3,724 1,862 931 2,794 1,397 4,192 2,096 1,048 524 262 131 394

← Previous Integer #2,227,685 Browse Full Index Next Integer #2,227,687 →