2,109,396

2² × 3 × 175783

2,109,396 factors as 2^2 × 3 × 175783. Its 12 positive divisors give a proper-divisor sum of 2,812,556, so this integer is abundant. The Collatz stopping time is 127 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 175783

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,921,952

Proper Divisor Sum 2,812,556

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2109391 ← → #2109403

Radix Representation

Decimal	2109396
Binary	1000000010111111010100 (22 bits)
Octal	0o10027724
Hexadecimal	0x202FD4

Divisor Catalog (12)

1 2 3 4 6 12 175,783 351,566 527,349 703,132 1,054,698 2,109,396

Collatz Trajectory (127 steps to reach 1)

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

2,109,396 1,054,698 527,349 1,582,048 791,024 395,512 197,756 98,878 49,439 148,318 74,159 222,478 111,239 333,718 166,859 500,578 250,289 750,868 375,434 187,717 563,152 281,576 140,788 70,394 35,197 105,592 52,796 26,398 13,199 39,598 19,799 59,398 29,699 89,098 44,549 133,648 66,824 33,412 16,706 8,353 25,060 12,530 6,265 18,796 9,398 4,699 14,098 7,049 21,148 10,574 5,287 15,862 7,931 23,794 11,897 35,692 17,846 8,923 26,770 13,385

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,109,395 Browse Full Index Next Integer #2,109,397 →