Base | Representation |
---|---|
bin | 11001000000101101011110… |
… | …111111000100100110000011 |
3 | 112102110220020012110002122101 |
4 | 121000231132333010212003 |
5 | 103404220000224310201 |
6 | 1025541145225251231 |
7 | 32112144366224365 |
oct | 3100553677044603 |
9 | 472426205402571 |
10 | 110000001010051 |
11 | 3205a813970049 |
12 | 104068a1933b17 |
13 | 494bc56566119 |
14 | 1d24058124d35 |
15 | cab544861d01 |
hex | 640b5efc4983 |
110000001010051 has 2 divisors, whose sum is σ = 110000001010052. Its totient is φ = 110000001010050.
The previous prime is 110000001010043. The next prime is 110000001010073. The reversal of 110000001010051 is 150010100000011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110000001010051 - 23 = 110000001010043 is a prime.
It is a super-2 number, since 2×1100000010100512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110000001010651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000000505025 + 55000000505026.
It is an arithmetic number, because the mean of its divisors is an integer number (55000000505026).
Almost surely, 2110000001010051 is an apocalyptic number.
110000001010051 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000001010051 is an equidigital number, since it uses as much as digits as its factorization.
110000001010051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 110000001010051 its reverse (150010100000011), we get a palindrome (260010101010062).
The spelling of 110000001010051 in words is "one hundred ten trillion, one million, ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •