Base | Representation |
---|---|
bin | 10100100111111010110001 |
3 | 101011200011111 |
4 | 110213322301 |
5 | 2341001020 |
6 | 311513321 |
7 | 63645025 |
oct | 24477261 |
9 | 11150144 |
10 | 5406385 |
11 | 3062996 |
12 | 1988841 |
13 | 1173a5a |
14 | a0a385 |
15 | 71bd5a |
hex | 527eb1 |
5406385 has 4 divisors (see below), whose sum is σ = 6487668. Its totient is φ = 4325104.
The previous prime is 5406377. The next prime is 5406397. The reversal of 5406385 is 5836045.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5836045 = 5 ⋅1167209.
It can be written as a sum of positive squares in 2 ways, for example, as 1281424 + 4124961 = 1132^2 + 2031^2 .
It is a cyclic number.
It is not a de Polignac number, because 5406385 - 23 = 5406377 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
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, 540634 + ... + 540643.
It is an arithmetic number, because the mean of its divisors is an integer number (1621917).
Almost surely, 25406385 is an apocalyptic number.
It is an amenable number.
5406385 is a deficient number, since it is larger than the sum of its proper divisors (1081283).
5406385 is a wasteful number, since it uses less digits than its factorization.
5406385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1081282.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 5406385 is about 2325.1634351159. The cubic root of 5406385 is about 175.5101846618.
The spelling of 5406385 in words is "five million, four hundred six thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •