Base | Representation |
---|---|
bin | 1101011111001… |
… | …0010100010001 |
3 | 10221102220102012 |
4 | 3113302110101 |
5 | 103440121212 |
6 | 5340232305 |
7 | 1254545351 |
oct | 327622421 |
9 | 127386365 |
10 | 56567057 |
11 | 29a26738 |
12 | 16b3b695 |
13 | b947541 |
14 | 7726b61 |
15 | 4e75922 |
hex | 35f2511 |
56567057 has 2 divisors, whose sum is σ = 56567058. Its totient is φ = 56567056.
The previous prime is 56567053. The next prime is 56567083. The reversal of 56567057 is 75076565.
56567057 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., 33918976 + 22648081 = 5824^2 + 4759^2 .
It is a cyclic number.
It is not a de Polignac number, because 56567057 - 22 = 56567053 is a prime.
It is not a weakly prime, because it can be changed into another prime (56567053) 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, 28283528 + 28283529.
It is an arithmetic number, because the mean of its divisors is an integer number (28283529).
Almost surely, 256567057 is an apocalyptic number.
It is an amenable number.
56567057 is a deficient number, since it is larger than the sum of its proper divisors (1).
56567057 is an equidigital number, since it uses as much as digits as its factorization.
56567057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 220500, while the sum is 41.
The square root of 56567057 is about 7521.1074317550. The cubic root of 56567057 is about 383.8732604926.
The spelling of 56567057 in words is "fifty-six million, five hundred sixty-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •