Base | Representation |
---|---|
bin | 100000001010010100111… |
… | …100100101101011110111 |
3 | 21211021200111211111101212 |
4 | 200022110330211223313 |
5 | 242202302144213421 |
6 | 4411151140312035 |
7 | 315450431616305 |
oct | 40122474455367 |
9 | 7737614744355 |
10 | 2210112101111 |
11 | 782337733242 |
12 | 2b84020a261b |
13 | 130549860515 |
14 | 78d81955275 |
15 | 3c7540a4e5b |
hex | 20294f25af7 |
2210112101111 has 4 divisors (see below), whose sum is σ = 2340118695312. Its totient is φ = 2080105506912.
The previous prime is 2210112101101. The next prime is 2210112101123. The reversal of 2210112101111 is 1111012110122.
2210112101111 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 not a de Polignac number, because 2210112101111 - 26 = 2210112101047 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2210112101101) 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, 65003297075 + ... + 65003297108.
It is an arithmetic number, because the mean of its divisors is an integer number (585029673828).
Almost surely, 22210112101111 is an apocalyptic number.
2210112101111 is a deficient number, since it is larger than the sum of its proper divisors (130006594201).
2210112101111 is a wasteful number, since it uses less digits than its factorization.
2210112101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130006594200.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 2210112101111 its reverse (1111012110122), we get a palindrome (3321124211233).
The spelling of 2210112101111 in words is "two trillion, two hundred ten billion, one hundred twelve million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •