Base | Representation |
---|---|
bin | 11110101111000011100… |
… | …100101010110101101111 |
3 | 21110220201120210121222120 |
4 | 132233003210222311233 |
5 | 234101100142041421 |
6 | 4254142345444023 |
7 | 305411025506616 |
oct | 36570344526557 |
9 | 7426646717876 |
10 | 2112110112111 |
11 | 7448171063aa |
12 | 2a14114a0613 |
13 | 12422bc7ca0c |
14 | 74325dd287d |
15 | 39e1a4888c6 |
hex | 1ebc392ad6f |
2112110112111 has 8 divisors (see below), whose sum is σ = 2816154069120. Its totient is φ = 1408069781592.
The previous prime is 2112110112059. The next prime is 2112110112137. The reversal of 2112110112111 is 1112110112112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2112110112111 - 29 = 2112110111599 is a prime.
It is a super-2 number, since 2×21121101121112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112110112311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1064646 + ... + 2314668.
It is an arithmetic number, because the mean of its divisors is an integer number (352019258640).
Almost surely, 22112110112111 is an apocalyptic number.
2112110112111 is a deficient number, since it is larger than the sum of its proper divisors (704043957009).
2112110112111 is a wasteful number, since it uses less digits than its factorization.
2112110112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1813245.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 2112110112111 its reverse (1112110112112), we get a palindrome (3224220224223).
Subtracting from 2112110112111 its reverse (1112110112112), we obtain a palindrome (999999999999).
The spelling of 2112110112111 in words is "two trillion, one hundred twelve billion, one hundred ten million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •