Base | Representation |
---|---|
bin | 11110100011110011000… |
… | …100100110100000000011 |
3 | 21102202112011002111201111 |
4 | 132203303010212200003 |
5 | 233401321130011321 |
6 | 4244423053544151 |
7 | 304502335261564 |
oct | 36436304464003 |
9 | 7382464074644 |
10 | 2100022110211 |
11 | 73a683808693 |
12 | 29abb91a5057 |
13 | 12305381587c |
14 | 738da82816b |
15 | 3995e1335e1 |
hex | 1e8f3126803 |
2100022110211 has 4 divisors (see below), whose sum is σ = 2100146381424. Its totient is φ = 2099897839000.
The previous prime is 2100022110187. The next prime is 2100022110217. The reversal of 2100022110211 is 1120112200012.
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 2100022110211 - 233 = 2091432175619 is a prime.
It is a super-2 number, since 2×21000221102112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2100022110191 and 2100022110200.
It is not an unprimeable number, because it can be changed into a prime (2100022110217) 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, 62110255 + ... + 62144056.
It is an arithmetic number, because the mean of its divisors is an integer number (525036595356).
Almost surely, 22100022110211 is an apocalyptic number.
2100022110211 is a deficient number, since it is larger than the sum of its proper divisors (124271213).
2100022110211 is a wasteful number, since it uses less digits than its factorization.
2100022110211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124271212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2100022110211 its reverse (1120112200012), we get a palindrome (3220134310223).
The spelling of 2100022110211 in words is "two trillion, one hundred billion, twenty-two million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •