5,623,152

2⁴ × 3 × 31 × 3779

5,623,152 factors as 2^4 × 3 × 31 × 3779. Its 40 positive divisors give a proper-divisor sum of 9,375,888, so this integer is abundant. The Collatz stopping time is 64 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 31 × 3779

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 14,999,040

Proper Divisor Sum 9,375,888

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #5623133 ← → #5623159

Radix Representation

Decimal	5623152
Binary	10101011100110101110000 (23 bits)
Octal	0o25346560
Hexadecimal	0x55CD70

Divisor Catalog (40)

1 2 3 4 6 8 12 16 24 31 48 62 93 124 186 248 372 496 744 1,488 3,779 7,558 11,337 15,116 22,674 30,232 45,348 60,464 90,696 117,149 181,392 234,298 351,447 468,596 702,894 937,192 1,405,788 1,874,384 2,811,576 5,623,152

Collatz Trajectory (64 steps to reach 1)

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

5,623,152 2,811,576 1,405,788 702,894 351,447 1,054,342 527,171 1,581,514 790,757 2,372,272 1,186,136 593,068 296,534 148,267 444,802 222,401 667,204 333,602 166,801 500,404 250,202 125,101 375,304 187,652 93,826 46,913 140,740 70,370 35,185 105,556 52,778 26,389 79,168 39,584 19,792 9,896 4,948 2,474 1,237 3,712 1,856 928 464 232 116 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5

← Previous Integer #5,623,151 Browse Full Index Next Integer #5,623,153 →