Base | Representation |
---|---|
bin | 1101100100101… |
… | …1001110001001 |
3 | 10222010101221022 |
4 | 3121023032021 |
5 | 104033244314 |
6 | 5352122225 |
7 | 1260623126 |
oct | 331131611 |
9 | 128111838 |
10 | 56931209 |
11 | 2a155295 |
12 | 17096375 |
13 | ba4420a |
14 | 77bd74d |
15 | 4ee878e |
hex | 364b389 |
56931209 has 2 divisors, whose sum is σ = 56931210. Its totient is φ = 56931208.
The previous prime is 56931191. The next prime is 56931223. The reversal of 56931209 is 90213965.
56931209 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., 52243984 + 4687225 = 7228^2 + 2165^2 .
It is a cyclic number.
It is not a de Polignac number, because 56931209 - 212 = 56927113 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (56931229) 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, 28465604 + 28465605.
It is an arithmetic number, because the mean of its divisors is an integer number (28465605).
Almost surely, 256931209 is an apocalyptic number.
It is an amenable number.
56931209 is a deficient number, since it is larger than the sum of its proper divisors (1).
56931209 is an equidigital number, since it uses as much as digits as its factorization.
56931209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 35.
The square root of 56931209 is about 7545.2772646206. The cubic root of 56931209 is about 384.6952307797.
The spelling of 56931209 in words is "fifty-six million, nine hundred thirty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •