Base | Representation |
---|---|
bin | 10100000000111000100001 |
3 | 100212112211201 |
4 | 110000320201 |
5 | 2320341442 |
6 | 304241201 |
7 | 62410624 |
oct | 24007041 |
9 | 10775751 |
10 | 5246497 |
11 | 2a63853 |
12 | 1910201 |
13 | 1119049 |
14 | 9a7dbb |
15 | 6d97b7 |
hex | 500e21 |
5246497 has 8 divisors (see below), whose sum is σ = 5350400. Its totient is φ = 5143824.
The previous prime is 5246491. The next prime is 5246503. The reversal of 5246497 is 7946425.
It is an interprime number because it is at equal distance from previous prime (5246491) and next prime (5246503).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5246497 is a prime.
It is a d-powerful number, because it can be written as 55 + 25 + 410 + 62 + 411 + 92 + 73 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5246491) 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 7 ways as a sum of consecutive naturals, for example, 13654 + ... + 14032.
It is an arithmetic number, because the mean of its divisors is an integer number (668800).
Almost surely, 25246497 is an apocalyptic number.
It is an amenable number.
5246497 is a deficient number, since it is larger than the sum of its proper divisors (103903).
5246497 is a wasteful number, since it uses less digits than its factorization.
5246497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 615.
The product of its digits is 60480, while the sum is 37.
The square root of 5246497 is about 2290.5233026538. The cubic root of 5246497 is about 173.7626680203.
It can be divided in two parts, 524 and 6497, that added together give a triangular number (7021 = T118).
The spelling of 5246497 in words is "five million, two hundred forty-six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.600 sec. • engine limits •