Base | Representation |
---|---|
bin | 1101010110100… |
… | …1001010011001 |
3 | 10220101100210101 |
4 | 3111221022121 |
5 | 103314132043 |
6 | 5320215401 |
7 | 1250015452 |
oct | 325511231 |
9 | 126340711 |
10 | 56005273 |
11 | 29682655 |
12 | 1690a561 |
13 | b7ab91c |
14 | 761c129 |
15 | 4db424d |
hex | 3569299 |
56005273 has 2 divisors, whose sum is σ = 56005274. Its totient is φ = 56005272.
The previous prime is 56005237. The next prime is 56005277. The reversal of 56005273 is 37250065.
56005273 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (56005237) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43388569 + 12616704 = 6587^2 + 3552^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56005273 is a prime.
It is not a weakly prime, because it can be changed into another prime (56005277) 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, 28002636 + 28002637.
It is an arithmetic number, because the mean of its divisors is an integer number (28002637).
Almost surely, 256005273 is an apocalyptic number.
It is an amenable number.
56005273 is a deficient number, since it is larger than the sum of its proper divisors (1).
56005273 is an equidigital number, since it uses as much as digits as its factorization.
56005273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6300, while the sum is 28.
The square root of 56005273 is about 7483.6670823868. The cubic root of 56005273 is about 382.5982443754.
The spelling of 56005273 in words is "fifty-six million, five thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •