Base | Representation |
---|---|
bin | 10100000101001111111110 |
3 | 100220110101010 |
4 | 110011033332 |
5 | 2321430012 |
6 | 304500050 |
7 | 62514024 |
oct | 24051776 |
9 | 10813333 |
10 | 5264382 |
11 | 2a76232 |
12 | 191a626 |
13 | 1124226 |
14 | 9b0714 |
15 | 6dec3c |
hex | 5053fe |
5264382 has 8 divisors (see below), whose sum is σ = 10528776. Its totient is φ = 1754792.
The previous prime is 5264381. The next prime is 5264383. The reversal of 5264382 is 2834625.
It is an interprime number because it is at equal distance from previous prime (5264381) and next prime (5264383).
It is a sphenic number, since it is the product of 3 distinct primes.
5264382 is an admirable number.
It is a d-powerful number, because it can be written as 5 + 25 + 6 + 410 + 313 + 87 + 219 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5264381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 438693 + ... + 438704.
It is an arithmetic number, because the mean of its divisors is an integer number (1316097).
Almost surely, 25264382 is an apocalyptic number.
5264382 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5264382 is a wasteful number, since it uses less digits than its factorization.
5264382 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 877402.
The product of its digits is 11520, while the sum is 30.
The square root of 5264382 is about 2294.4241107520. The cubic root of 5264382 is about 173.9598929888.
It can be divided in two parts, 52643 and 82, that added together give a palindrome (52725).
The spelling of 5264382 in words is "five million, two hundred sixty-four thousand, three hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •