Base | Representation |
---|---|
bin | 10100100101000000000101 |
3 | 101011001202222 |
4 | 110211000011 |
5 | 2340110222 |
6 | 311342125 |
7 | 63565136 |
oct | 24450005 |
9 | 11131688 |
10 | 5394437 |
11 | 3054a14 |
12 | 1981945 |
13 | 116b499 |
14 | a05c8d |
15 | 718542 |
hex | 525005 |
5394437 has 2 divisors, whose sum is σ = 5394438. Its totient is φ = 5394436.
The previous prime is 5394407. The next prime is 5394439. The reversal of 5394437 is 7344935.
5394437 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5387041 + 7396 = 2321^2 + 86^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5394437 is a prime.
Together with 5394439, it forms a pair of twin primes.
It is a Chen prime.
It is an Ulam number.
It is a junction number, because it is equal to n+sod(n) for n = 5394397 and 5394406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5394439) 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 as a sum of consecutive naturals, namely, 2697218 + 2697219.
It is an arithmetic number, because the mean of its divisors is an integer number (2697219).
Almost surely, 25394437 is an apocalyptic number.
It is an amenable number.
5394437 is a deficient number, since it is larger than the sum of its proper divisors (1).
5394437 is an equidigital number, since it uses as much as digits as its factorization.
5394437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 45360, while the sum is 35.
The square root of 5394437 is about 2322.5927322714. The cubic root of 5394437 is about 175.3807979978.
The spelling of 5394437 in words is "five million, three hundred ninety-four thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •