4,790,346

2 × 3 × 11 × 181 × 401

4,790,346 factors as 2 × 3 × 11 × 181 × 401. Its 32 positive divisors give a proper-divisor sum of 5,745,270, so this integer is abundant. The Collatz stopping time is 193 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 181 × 401

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 10,535,616

Proper Divisor Sum 5,745,270

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4790339 ← → #4790351

Radix Representation

Decimal	4790346
Binary	10010010001100001001010 (23 bits)
Octal	0o22214112
Hexadecimal	0x49184A

Divisor Catalog (32)

1 2 3 6 11 22 33 66 181 362 401 543 802 1,086 1,203 1,991 2,406 3,982 4,411 5,973 8,822 11,946 13,233 26,466 72,581 145,162 217,743 435,486 798,391 1,596,782 2,395,173 4,790,346

Collatz Trajectory (193 steps to reach 1)

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

4,790,346 2,395,173 7,185,520 3,592,760 1,796,380 898,190 449,095 1,347,286 673,643 2,020,930 1,010,465 3,031,396 1,515,698 757,849 2,273,548 1,136,774 568,387 1,705,162 852,581 2,557,744 1,278,872 639,436 319,718 159,859 479,578 239,789 719,368 359,684 179,842 89,921 269,764 134,882 67,441 202,324 101,162 50,581 151,744 75,872 37,936 18,968 9,484 4,742 2,371 7,114 3,557 10,672 5,336 2,668 1,334 667 2,002 1,001 3,004 1,502 751 2,254 1,127 3,382 1,691 5,074

← Previous Integer #4,790,345 Browse Full Index Next Integer #4,790,347 →