Base | Representation |
---|---|
bin | 1001001101001011011011… |
… | …1000000100101100111011 |
3 | 1022211122200100122102122111 |
4 | 2103102312320010230323 |
5 | 2311314334320231021 |
6 | 33305553202233151 |
7 | 2063201604531004 |
oct | 223226670045473 |
9 | 38748610572574 |
10 | 10122011102011 |
11 | 32527a2428916 |
12 | 11758690557b7 |
13 | 585669ba6283 |
14 | 26dc9d5c01ab |
15 | 12846b7508e1 |
hex | 934b6e04b3b |
10122011102011 has 2 divisors, whose sum is σ = 10122011102012. Its totient is φ = 10122011102010.
The previous prime is 10122011102009. The next prime is 10122011102057. The reversal of 10122011102011 is 11020111022101.
It is a happy number.
10122011102011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10122011102011 - 21 = 10122011102009 is a prime.
Together with 10122011102009, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10122011101982 and 10122011102000.
It is not a weakly prime, because it can be changed into another prime (10122011402011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061005551005 + 5061005551006.
It is an arithmetic number, because the mean of its divisors is an integer number (5061005551006).
Almost surely, 210122011102011 is an apocalyptic number.
10122011102011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122011102011 is an equidigital number, since it uses as much as digits as its factorization.
10122011102011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10122011102011 its reverse (11020111022101), we get a palindrome (21142122124112).
The spelling of 10122011102011 in words is "ten trillion, one hundred twenty-two billion, eleven million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •