21,865,578

2 × 3 × 7 × 520609

21,865,578 factors as 2 × 3 × 7 × 520609. Its 16 positive divisors give a proper-divisor sum of 28,112,982, so this integer is abundant. The Collatz stopping time is 58 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 520609

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 49,978,560

Proper Divisor Sum 28,112,982

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #21865573 ← → #21865579

Radix Representation

Decimal	21865578
Binary	1010011011010010001101010 (25 bits)
Octal	0o123322152
Hexadecimal	0x14DA46A

Divisor Catalog (16)

1 2 3 6 7 14 21 42 520,609 1,041,218 1,561,827 3,123,654 3,644,263 7,288,526 10,932,789 21,865,578

Collatz Trajectory (58 steps to reach 1)

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

21,865,578 10,932,789 32,798,368 16,399,184 8,199,592 4,099,796 2,049,898 1,024,949 3,074,848 1,537,424 768,712 384,356 192,178 96,089 288,268 144,134 72,067 216,202 108,101 324,304 162,152 81,076 40,538 20,269 60,808 30,404 15,202 7,601 22,804 11,402 5,701 17,104 8,552 4,276 2,138 1,069 3,208 1,604 802 401 1,204 602 301 904 452 226 113 340 170 85 256 128 64 32 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #21,865,577 Browse Full Index Next Integer #21,865,579 →