Base | Representation |
---|---|
bin | 1101101011111… |
… | …0100000000101 |
3 | 11000000101122202 |
4 | 3122332200011 |
5 | 104143402042 |
6 | 5410204245 |
7 | 1264630562 |
oct | 332764005 |
9 | 130011582 |
10 | 57403397 |
11 | 2a448027 |
12 | 17283685 |
13 | bb7b10c |
14 | 78a3869 |
15 | 508d632 |
hex | 36be805 |
57403397 has 2 divisors, whose sum is σ = 57403398. Its totient is φ = 57403396.
The previous prime is 57403387. The next prime is 57403417. The reversal of 57403397 is 79330475.
57403397 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., 51638596 + 5764801 = 7186^2 + 2401^2 .
It is a cyclic number.
It is not a de Polignac number, because 57403397 - 28 = 57403141 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 57403397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (57403337) 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, 28701698 + 28701699.
It is an arithmetic number, because the mean of its divisors is an integer number (28701699).
Almost surely, 257403397 is an apocalyptic number.
It is an amenable number.
57403397 is a deficient number, since it is larger than the sum of its proper divisors (1).
57403397 is an equidigital number, since it uses as much as digits as its factorization.
57403397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 79380, while the sum is 38.
The square root of 57403397 is about 7576.5029532100. The cubic root of 57403397 is about 385.7558592004.
The spelling of 57403397 in words is "fifty-seven million, four hundred three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •