Base | Representation |
---|---|
bin | 110100001100110101… |
… | …110100100010001011 |
3 | 12100200012222112110121 |
4 | 310030311310202023 |
5 | 1404242300312001 |
6 | 41425442124111 |
7 | 4022654140414 |
oct | 641465644213 |
9 | 170605875417 |
10 | 56050010251 |
11 | 21852851324 |
12 | aa43050637 |
13 | 53932c8751 |
14 | 29da03a80b |
15 | 16d0aaa6a1 |
hex | d0cd7488b |
56050010251 has 2 divisors, whose sum is σ = 56050010252. Its totient is φ = 56050010250.
The previous prime is 56050010231. The next prime is 56050010267. The reversal of 56050010251 is 15201005065.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 56050010251 - 29 = 56050009739 is a prime.
It is not a weakly prime, because it can be changed into another prime (56050010231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28025005125 + 28025005126.
It is an arithmetic number, because the mean of its divisors is an integer number (28025005126).
Almost surely, 256050010251 is an apocalyptic number.
56050010251 is a deficient number, since it is larger than the sum of its proper divisors (1).
56050010251 is an equidigital number, since it uses as much as digits as its factorization.
56050010251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 25.
The spelling of 56050010251 in words is "fifty-six billion, fifty million, ten thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •