Base | Representation |
---|---|
bin | 1001001011111101111100… |
… | …0010100101110000100011 |
3 | 1022202122222200220121022102 |
4 | 2102333133002211300203 |
5 | 2310444234242023021 |
6 | 33252233141001015 |
7 | 2061534255162245 |
oct | 222773702456043 |
9 | 38678880817272 |
10 | 10101210111011 |
11 | 3244998851468 |
12 | 11718229b316b |
13 | 58370358c686 |
14 | 26cc88b92095 |
15 | 127b5051400b |
hex | 92fdf0a5c23 |
10101210111011 has 16 divisors (see below), whose sum is σ = 10129287168000. Its totient is φ = 10073183649408.
The previous prime is 10101210110989. The next prime is 10101210111127. The reversal of 10101210111011 is 11011101210101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10101210111011 - 234 = 10084030241827 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10101210110983 and 10101210111001.
It is not an unprimeable number, because it can be changed into a prime (10101210171011) 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 in 15 ways as a sum of consecutive naturals, for example, 2494739915 + ... + 2494743963.
It is an arithmetic number, because the mean of its divisors is an integer number (633080448000).
Almost surely, 210101210111011 is an apocalyptic number.
10101210111011 is a deficient number, since it is larger than the sum of its proper divisors (28077056989).
10101210111011 is a wasteful number, since it uses less digits than its factorization.
10101210111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8738.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 10101210111011 its reverse (11011101210101), we get a palindrome (21112311321112).
The spelling of 10101210111011 in words is "ten trillion, one hundred one billion, two hundred ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •