Base | Representation |
---|---|
bin | 1100101110101… |
… | …1110000000101 |
3 | 10201110201101202 |
4 | 3023223300011 |
5 | 102132110222 |
6 | 5144232245 |
7 | 1215562625 |
oct | 313536005 |
9 | 121421352 |
10 | 53394437 |
11 | 2815a038 |
12 | 15a6b685 |
13 | b0a6455 |
14 | 713c885 |
15 | 4a4a892 |
hex | 32ebc05 |
53394437 has 2 divisors, whose sum is σ = 53394438. Its totient is φ = 53394436.
The previous prime is 53394379. The next prime is 53394443. The reversal of 53394437 is 73449335.
53394437 is digitally balanced in base 2, 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., 49126081 + 4268356 = 7009^2 + 2066^2 .
It is a cyclic number.
It is not a de Polignac number, because 53394437 - 28 = 53394181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53394437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53394137) 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 as a sum of consecutive naturals, namely, 26697218 + 26697219.
It is an arithmetic number, because the mean of its divisors is an integer number (26697219).
Almost surely, 253394437 is an apocalyptic number.
It is an amenable number.
53394437 is a deficient number, since it is larger than the sum of its proper divisors (1).
53394437 is an equidigital number, since it uses as much as digits as its factorization.
53394437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 136080, while the sum is 38.
The square root of 53394437 is about 7307.1497179133. The cubic root of 53394437 is about 376.5581085684.
The spelling of 53394437 in words is "fifty-three million, three hundred ninety-four thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •