2,806,790

2 × 5 × 7 × 101 × 397

2,806,790 factors as 2 × 5 × 7 × 101 × 397. Its 32 positive divisors give a proper-divisor sum of 3,039,034, so this integer is abundant. The Collatz stopping time is 130 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 101 × 397

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 5,845,824

Proper Divisor Sum 3,039,034

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #2806789 ← → #2806801

Radix Representation

Decimal	2806790
Binary	1010101101010000000110 (22 bits)
Octal	0o12552006
Hexadecimal	0x2AD406

Divisor Catalog (32)

Collatz Trajectory (130 steps to reach 1)

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

2,806,790 1,403,395 4,210,186 2,105,093 6,315,280 3,157,640 1,578,820 789,410 394,705 1,184,116 592,058 296,029 888,088 444,044 222,022 111,011 333,034 166,517 499,552 249,776 124,888 62,444 31,222 15,611 46,834 23,417 70,252 35,126 17,563 52,690 26,345 79,036 39,518 19,759 59,278 29,639 88,918 44,459 133,378 66,689 200,068 100,034 50,017 150,052 75,026 37,513 112,540 56,270 28,135 84,406 42,203 126,610 63,305 189,916 94,958 47,479 142,438 71,219 213,658 106,829

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,806,789 Browse Full Index Next Integer #2,806,791 →