Base | Representation |
---|---|
bin | 1101011001101… |
… | …1001010100001 |
3 | 10220202202201212 |
4 | 3112123022201 |
5 | 103342210311 |
6 | 5324435505 |
7 | 1251530534 |
oct | 326331241 |
9 | 126682655 |
10 | 56210081 |
11 | 29802514 |
12 | 169a8b95 |
13 | b850c05 |
14 | 7672a1b |
15 | 4e04c8b |
hex | 359b2a1 |
56210081 has 2 divisors, whose sum is σ = 56210082. Its totient is φ = 56210080.
The previous prime is 56210069. The next prime is 56210153. The reversal of 56210081 is 18001265.
56210081 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., 50183056 + 6027025 = 7084^2 + 2455^2 .
It is a cyclic number.
It is not a de Polignac number, because 56210081 - 26 = 56210017 is a prime.
It is a super-2 number, since 2×562100812 = 6319146412053122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (56210681) 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, 28105040 + 28105041.
It is an arithmetic number, because the mean of its divisors is an integer number (28105041).
Almost surely, 256210081 is an apocalyptic number.
It is an amenable number.
56210081 is a deficient number, since it is larger than the sum of its proper divisors (1).
56210081 is an equidigital number, since it uses as much as digits as its factorization.
56210081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 56210081 is about 7497.3382610097. The cubic root of 56210081 is about 383.0640568029.
The spelling of 56210081 in words is "fifty-six million, two hundred ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •