Base | Representation |
---|---|
bin | 11101011001011110101… |
… | …00000110010000010011 |
3 | 10120120021101021010220111 |
4 | 32230233110012100103 |
5 | 113022201421042321 |
6 | 2052012202422151 |
7 | 132656331534205 |
oct | 16545724062023 |
9 | 3516241233814 |
10 | 1010111112211 |
11 | 35a427431183 |
12 | 143924201957 |
13 | 74339cba686 |
14 | 36c65250775 |
15 | 1b41e2715e1 |
hex | eb2f506413 |
1010111112211 has 4 divisors (see below), whose sum is σ = 1011748245912. Its totient is φ = 1008473978512.
The previous prime is 1010111112191. The next prime is 1010111112229. The reversal of 1010111112211 is 1122111110101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1010111112211 - 219 = 1010110587923 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010111112191 and 1010111112200.
It is not an unprimeable number, because it can be changed into a prime (1010111112911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 818565925 + ... + 818567158.
It is an arithmetic number, because the mean of its divisors is an integer number (252937061478).
Almost surely, 21010111112211 is an apocalyptic number.
1010111112211 is a deficient number, since it is larger than the sum of its proper divisors (1637133701).
1010111112211 is an equidigital number, since it uses as much as digits as its factorization.
1010111112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1637133700.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1010111112211 its reverse (1122111110101), we get a palindrome (2132222222312).
The spelling of 1010111112211 in words is "one trillion, ten billion, one hundred eleven million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •