5,416,032

2⁵ × 3 × 56417

5,416,032 factors as 2^5 × 3 × 56417. Its 24 positive divisors give a proper-divisor sum of 8,801,304, so this integer is abundant. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 56417

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 14,217,336

Proper Divisor Sum 8,801,304

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #5416031 ← → #5416039

Radix Representation

Decimal	5416032
Binary	10100101010010001100000 (23 bits)
Octal	0o24522140
Hexadecimal	0x52A460

Divisor Catalog (24)

1 2 3 4 6 8 12 16 24 32 48 96 56,417 112,834 169,251 225,668 338,502 451,336 677,004 902,672 1,354,008 1,805,344 2,708,016 5,416,032

Collatz Trajectory (87 steps to reach 1)

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

5,416,032 2,708,016 1,354,008 677,004 338,502 169,251 507,754 253,877 761,632 380,816 190,408 95,204 47,602 23,801 71,404 35,702 17,851 53,554 26,777 80,332 40,166 20,083 60,250 30,125 90,376 45,188 22,594 11,297 33,892 16,946 8,473 25,420 12,710 6,355 19,066 9,533 28,600 14,300 7,150 3,575 10,726 5,363 16,090 8,045 24,136 12,068 6,034 3,017 9,052 4,526 2,263 6,790 3,395 10,186 5,093 15,280 7,640 3,820 1,910 955

← Previous Integer #5,416,031 Browse Full Index Next Integer #5,416,033 →