Base | Representation |
---|---|
bin | 110100001100111000… |
… | …001110010101111011 |
3 | 12100200021011112122221 |
4 | 310030320032111323 |
5 | 1404242430442001 |
6 | 41425503424511 |
7 | 4022662403224 |
oct | 641470162573 |
9 | 170607145587 |
10 | 56050640251 |
11 | 21853141691 |
12 | aa432b5137 |
13 | 5393489428 |
14 | 29da16224b |
15 | 16d0b821a1 |
hex | d0ce0e57b |
56050640251 has 2 divisors, whose sum is σ = 56050640252. Its totient is φ = 56050640250.
The previous prime is 56050640237. The next prime is 56050640293. The reversal of 56050640251 is 15204605065.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56050640251 - 27 = 56050640123 is a prime.
It is not a weakly prime, because it can be changed into another prime (56050640201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28025320125 + 28025320126.
It is an arithmetic number, because the mean of its divisors is an integer number (28025320126).
Almost surely, 256050640251 is an apocalyptic number.
56050640251 is a deficient number, since it is larger than the sum of its proper divisors (1).
56050640251 is an equidigital number, since it uses as much as digits as its factorization.
56050640251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 34.
The spelling of 56050640251 in words is "fifty-six billion, fifty million, six hundred forty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •