Base | Representation |
---|---|
bin | 1101100110001… |
… | …0011101100001 |
3 | 10222022020111221 |
4 | 3121202131201 |
5 | 104044321101 |
6 | 5354135041 |
7 | 1261500505 |
oct | 331423541 |
9 | 128266457 |
10 | 57026401 |
11 | 2a20a863 |
12 | 17121481 |
13 | ba78643 |
14 | 7806305 |
15 | 5016aa1 |
hex | 3662761 |
57026401 has 2 divisors, whose sum is σ = 57026402. Its totient is φ = 57026400.
The previous prime is 57026393. The next prime is 57026423. The reversal of 57026401 is 10462075.
57026401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50751376 + 6275025 = 7124^2 + 2505^2 .
It is a cyclic number.
It is not a de Polignac number, because 57026401 - 23 = 57026393 is a prime.
It is a super-2 number, since 2×570264012 = 6504020822025602, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (57006401) 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, 28513200 + 28513201.
It is an arithmetic number, because the mean of its divisors is an integer number (28513201).
Almost surely, 257026401 is an apocalyptic number.
It is an amenable number.
57026401 is a deficient number, since it is larger than the sum of its proper divisors (1).
57026401 is an equidigital number, since it uses as much as digits as its factorization.
57026401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 57026401 is about 7551.5826817959. The cubic root of 57026401 is about 384.9095216631.
Adding to 57026401 its reverse (10462075), we get a palindrome (67488476).
The spelling of 57026401 in words is "fifty-seven million, twenty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •