8,568,490

2 × 5 × 7 × 109 × 1123

8,568,490 factors as 2 × 5 × 7 × 109 × 1123. Its 32 positive divisors give a proper-divisor sum of 9,235,670, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 109 × 1123

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 17,804,160

Proper Divisor Sum 9,235,670

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #8568473 ← → #8568491

Radix Representation

Decimal	8568490
Binary	100000101011111010101010 (24 bits)
Octal	0o40537252
Hexadecimal	0x82BEAA

Divisor Catalog (32)

Collatz Trajectory (168 steps to reach 1)

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

8,568,490 4,284,245 12,852,736 6,426,368 3,213,184 1,606,592 803,296 401,648 200,824 100,412 50,206 25,103 75,310 37,655 112,966 56,483 169,450 84,725 254,176 127,088 63,544 31,772 15,886 7,943 23,830 11,915 35,746 17,873 53,620 26,810 13,405 40,216 20,108 10,054 5,027 15,082 7,541 22,624 11,312 5,656 2,828 1,414 707 2,122 1,061 3,184 1,592 796 398 199 598 299 898 449 1,348 674 337 1,012 506 253

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,568,489 Browse Full Index Next Integer #8,568,491 →