Base | Representation |
---|---|
bin | 1001001101001100001011… |
… | …0111001111100101000011 |
3 | 1022211200012101001211022222 |
4 | 2103103002313033211003 |
5 | 2311320242311223021 |
6 | 33310025144521255 |
7 | 2063206566114425 |
oct | 223230267174503 |
9 | 38750171054288 |
10 | 10122212211011 |
11 | 32528959a8aaa |
12 | 117590448022b |
13 | 58569c75b294 |
14 | 26dcbc1b0815 |
15 | 12847e2286ab |
hex | 934c2dcf943 |
10122212211011 has 4 divisors (see below), whose sum is σ = 10357612495032. Its totient is φ = 9886811926992.
The previous prime is 10122212210987. The next prime is 10122212211017. The reversal of 10122212211011 is 11011221222101.
10122212211011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10122212211011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10122212211017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 117700141946 + ... + 117700142031.
It is an arithmetic number, because the mean of its divisors is an integer number (2589403123758).
Almost surely, 210122212211011 is an apocalyptic number.
10122212211011 is a deficient number, since it is larger than the sum of its proper divisors (235400284021).
10122212211011 is an equidigital number, since it uses as much as digits as its factorization.
10122212211011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 235400284020.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10122212211011 its reverse (11011221222101), we get a palindrome (21133433433112).
The spelling of 10122212211011 in words is "ten trillion, one hundred twenty-two billion, two hundred twelve million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •