Base | Representation |
---|---|
bin | 10111001111100001110111… |
… | …00011111110111101010111 |
3 | 20200222011201010212011002112 |
4 | 23213300323203332331113 |
5 | 23144401023142023223 |
6 | 300412041515101235 |
7 | 13523440645505042 |
oct | 1347607343767527 |
9 | 220864633764075 |
10 | 51111110111063 |
11 | 15316111214a52 |
12 | 589581344181b |
13 | 22699ac199662 |
14 | c89b10445c59 |
15 | 5d97b5ba0778 |
hex | 2e7c3b8fef57 |
51111110111063 has 2 divisors, whose sum is σ = 51111110111064. Its totient is φ = 51111110111062.
The previous prime is 51111110111041. The next prime is 51111110111077. The reversal of 51111110111063 is 36011101111115.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51111110111063 - 214 = 51111110094679 is a prime.
It is a super-2 number, since 2×511111101110632 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51111110111863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25555555055531 + 25555555055532.
It is an arithmetic number, because the mean of its divisors is an integer number (25555555055532).
Almost surely, 251111110111063 is an apocalyptic number.
51111110111063 is a deficient number, since it is larger than the sum of its proper divisors (1).
51111110111063 is an equidigital number, since it uses as much as digits as its factorization.
51111110111063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 23.
Adding to 51111110111063 its reverse (36011101111115), we get a palindrome (87122211222178).
The spelling of 51111110111063 in words is "fifty-one trillion, one hundred eleven billion, one hundred ten million, one hundred eleven thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •