Base | Representation |
---|---|
bin | 1001001100011111001000… |
… | …0111001100111001101011 |
3 | 1022210111222122110221220022 |
4 | 2103013302013030321223 |
5 | 2311121011211142421 |
6 | 33300305223151055 |
7 | 2062301125156061 |
oct | 223076207147153 |
9 | 38714878427808 |
10 | 10110120021611 |
11 | 3248750200145 |
12 | 11734aa8a548b |
13 | 5844c348911c |
14 | 26d492236031 |
15 | 127ec28477ab |
hex | 931f21cce6b |
10110120021611 has 2 divisors, whose sum is σ = 10110120021612. Its totient is φ = 10110120021610.
The previous prime is 10110120021601. The next prime is 10110120021643. The reversal of 10110120021611 is 11612002101101.
It is a weak prime.
It is an emirp because it is prime and its reverse (11612002101101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10110120021611 - 238 = 9835242114667 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10110120021611.
It is not a weakly prime, because it can be changed into another prime (10110120021601) 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, 5055060010805 + 5055060010806.
It is an arithmetic number, because the mean of its divisors is an integer number (5055060010806).
Almost surely, 210110120021611 is an apocalyptic number.
10110120021611 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110120021611 is an equidigital number, since it uses as much as digits as its factorization.
10110120021611 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 10110120021611 its reverse (11612002101101), we get a palindrome (21722122122712).
The spelling of 10110120021611 in words is "ten trillion, one hundred ten billion, one hundred twenty million, twenty-one thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •