Base | Representation |
---|---|
bin | 10100000001001011000001 |
3 | 100212121110120 |
4 | 110001023001 |
5 | 2320411211 |
6 | 304250453 |
7 | 62414235 |
oct | 24011301 |
9 | 10777416 |
10 | 5247681 |
11 | 2a6472a |
12 | 1910a29 |
13 | 111974a |
14 | 9a85c5 |
15 | 6d9d06 |
hex | 5012c1 |
5247681 has 12 divisors (see below), whose sum is σ = 7117296. Its totient is φ = 3439240.
The previous prime is 5247661. The next prime is 5247701. The reversal of 5247681 is 1867425.
It is an interprime number because it is at equal distance from previous prime (5247661) and next prime (5247701).
It is not a de Polignac number, because 5247681 - 214 = 5231297 is a prime.
It is a super-2 number, since 2×52476812 = 55076311755522, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
5247681 is a lucky number.
It is not an unprimeable number, because it can be changed into a prime (5247661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14950 + ... + 15296.
It is an arithmetic number, because the mean of its divisors is an integer number (593108).
Almost surely, 25247681 is an apocalyptic number.
It is an amenable number.
5247681 is a deficient number, since it is larger than the sum of its proper divisors (1869615).
5247681 is an equidigital number, since it uses as much as digits as its factorization.
5247681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492 (or 421 counting only the distinct ones).
The product of its digits is 13440, while the sum is 33.
The square root of 5247681 is about 2290.7817442960. The cubic root of 5247681 is about 173.7757382984.
The spelling of 5247681 in words is "five million, two hundred forty-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •