2,390,568

2³ × 3 × 99607

2,390,568 factors as 2^3 × 3 × 99607. Its 16 positive divisors give a proper-divisor sum of 3,585,912, so this integer is abundant. The Collatz stopping time is 161 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 99607

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,976,480

Proper Divisor Sum 3,585,912

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2390543 ← → #2390579

Radix Representation

Decimal	2390568
Binary	1001000111101000101000 (22 bits)
Octal	0o11075050
Hexadecimal	0x247A28

Divisor Catalog (16)

1 2 3 4 6 8 12 24 99,607 199,214 298,821 398,428 597,642 796,856 1,195,284 2,390,568

Collatz Trajectory (161 steps to reach 1)

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

2,390,568 1,195,284 597,642 298,821 896,464 448,232 224,116 112,058 56,029 168,088 84,044 42,022 21,011 63,034 31,517 94,552 47,276 23,638 11,819 35,458 17,729 53,188 26,594 13,297 39,892 19,946 9,973 29,920 14,960 7,480 3,740 1,870 935 2,806 1,403 4,210 2,105 6,316 3,158 1,579 4,738 2,369 7,108 3,554 1,777 5,332 2,666 1,333 4,000 2,000 1,000 500 250 125 376 188 94 47 142 71

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,390,567 Browse Full Index Next Integer #2,390,569 →