5,395,338

2 × 3² × 13 × 23057

5,395,338 factors as 2 × 3^2 × 13 × 23057. Its 24 positive divisors give a proper-divisor sum of 7,194,330, so this integer is abundant. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 13 × 23057

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 12,589,668

Proper Divisor Sum 7,194,330

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5395337 ← → #5395343

Radix Representation

Decimal	5395338
Binary	10100100101001110001010 (23 bits)
Octal	0o24451612
Hexadecimal	0x52538A

Divisor Catalog (24)

1 2 3 6 9 13 18 26 39 78 117 234 23,057 46,114 69,171 138,342 207,513 299,741 415,026 599,482 899,223 1,798,446 2,697,669 5,395,338

Collatz Trajectory (87 steps to reach 1)

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

5,395,338 2,697,669 8,093,008 4,046,504 2,023,252 1,011,626 505,813 1,517,440 758,720 379,360 189,680 94,840 47,420 23,710 11,855 35,566 17,783 53,350 26,675 80,026 40,013 120,040 60,020 30,010 15,005 45,016 22,508 11,254 5,627 16,882 8,441 25,324 12,662 6,331 18,994 9,497 28,492 14,246 7,123 21,370 10,685 32,056 16,028 8,014 4,007 12,022 6,011 18,034 9,017 27,052 13,526 6,763 20,290 10,145 30,436 15,218 7,609 22,828 11,414 5,707

← Previous Integer #5,395,337 Browse Full Index Next Integer #5,395,339 →