2,094,580

2² × 5 × 104729

2,094,580 factors as 2^2 × 5 × 104729. Its 12 positive divisors give a proper-divisor sum of 2,304,080, so this integer is abundant. The Collatz stopping time is 73 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 104729

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,398,660

Proper Divisor Sum 2,304,080

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #2094569 ← → #2094601

Radix Representation

Decimal	2094580
Binary	111111111010111110100 (21 bits)
Octal	0o7772764
Hexadecimal	0x1FF5F4

Divisor Catalog (12)

1 2 4 5 10 20 104,729 209,458 418,916 523,645 1,047,290 2,094,580

Collatz Trajectory (73 steps to reach 1)

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

2,094,580 1,047,290 523,645 1,570,936 785,468 392,734 196,367 589,102 294,551 883,654 441,827 1,325,482 662,741 1,988,224 994,112 497,056 248,528 124,264 62,132 31,066 15,533 46,600 23,300 11,650 5,825 17,476 8,738 4,369 13,108 6,554 3,277 9,832 4,916 2,458 1,229 3,688 1,844 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,094,579 Browse Full Index Next Integer #2,094,581 →