Base | Representation |
---|---|
bin | 10111001111001101001011… |
… | …01001110001010100010101 |
3 | 20200221010001012211200221011 |
4 | 23213212211221301110111 |
5 | 23144210302302023221 |
6 | 300403003540252221 |
7 | 13522565522533534 |
oct | 1347464551612425 |
9 | 220833035750834 |
10 | 51100005111061 |
11 | 153114327900a5 |
12 | 58936343a1071 |
13 | 226892c59a73a |
14 | c8937964231b |
15 | 5d9365cc01e1 |
hex | 2e79a5a71515 |
51100005111061 has 2 divisors, whose sum is σ = 51100005111062. Its totient is φ = 51100005111060.
The previous prime is 51100005111041. The next prime is 51100005111073. The reversal of 51100005111061 is 16011150000115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28031253747025 + 23068751364036 = 5294455^2 + 4802994^2 .
It is a cyclic number.
It is not a de Polignac number, because 51100005111061 - 213 = 51100005102869 is a prime.
It is a super-2 number, since 2×511000051110612 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51100005111041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25550002555530 + 25550002555531.
It is an arithmetic number, because the mean of its divisors is an integer number (25550002555531).
Almost surely, 251100005111061 is an apocalyptic number.
It is an amenable number.
51100005111061 is a deficient number, since it is larger than the sum of its proper divisors (1).
51100005111061 is an equidigital number, since it uses as much as digits as its factorization.
51100005111061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 150, while the sum is 22.
Adding to 51100005111061 its reverse (16011150000115), we get a palindrome (67111155111176).
The spelling of 51100005111061 in words is "fifty-one trillion, one hundred billion, five million, one hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •