4,597,806

2 × 3 × 766301

4,597,806 factors as 2 × 3 × 766301. Its 8 positive divisors give a proper-divisor sum of 4,597,818, so this integer is abundant. The Collatz stopping time is 224 steps.

Prime Factor Structure

Factorization String 2 × 3 × 766301

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 9,195,624

Proper Divisor Sum 4,597,818

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4597793 ← → #4597807

Radix Representation

Decimal	4597806
Binary	10001100010100000101110 (23 bits)
Octal	0o21424056
Hexadecimal	0x46282E

Divisor Catalog (8)

1 2 3 6 766,301 1,532,602 2,298,903 4,597,806

Collatz Trajectory (224 steps to reach 1)

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

4,597,806 2,298,903 6,896,710 3,448,355 10,345,066 5,172,533 15,517,600 7,758,800 3,879,400 1,939,700 969,850 484,925 1,454,776 727,388 363,694 181,847 545,542 272,771 818,314 409,157 1,227,472 613,736 306,868 153,434 76,717 230,152 115,076 57,538 28,769 86,308 43,154 21,577 64,732 32,366 16,183 48,550 24,275 72,826 36,413 109,240 54,620 27,310 13,655 40,966 20,483 61,450 30,725 92,176 46,088 23,044 11,522 5,761 17,284 8,642 4,321 12,964 6,482 3,241 9,724 4,862

← Previous Integer #4,597,805 Browse Full Index Next Integer #4,597,807 →