Base | Representation |
---|---|
bin | 100000001011010001000… |
… | …001011111111001101101 |
3 | 21211101021202102010200212 |
4 | 200023101001133321231 |
5 | 242211333211133401 |
6 | 4411435143432205 |
7 | 315514421034455 |
oct | 40132101377155 |
9 | 7741252363625 |
10 | 2211120021101 |
11 | 782804676472 |
12 | 2b8643755665 |
13 | 13067a611594 |
14 | 79039764d65 |
15 | 3c7b27ecdbb |
hex | 202d105fe6d |
2211120021101 has 4 divisors (see below), whose sum is σ = 2287365539100. Its totient is φ = 2134874503104.
The previous prime is 2211120021037. The next prime is 2211120021157. The reversal of 2211120021101 is 1011200211122.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1778088902500 + 433031118601 = 1333450^2 + 658051^2 .
It is not a de Polignac number, because 2211120021101 - 26 = 2211120021037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211120021301) 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, 38122758956 + ... + 38122759013.
It is an arithmetic number, because the mean of its divisors is an integer number (571841384775).
Almost surely, 22211120021101 is an apocalyptic number.
It is an amenable number.
2211120021101 is a deficient number, since it is larger than the sum of its proper divisors (76245517999).
2211120021101 is an equidigital number, since it uses as much as digits as its factorization.
2211120021101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76245517998.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2211120021101 its reverse (1011200211122), we get a palindrome (3222320232223).
The spelling of 2211120021101 in words is "two trillion, two hundred eleven billion, one hundred twenty million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •