Base | Representation |
---|---|
bin | 11110101101000101110… |
… | …111011101110001100000 |
3 | 21110201021121100020010102 |
4 | 132231011313131301200 |
5 | 234032240241010422 |
6 | 4253153210321532 |
7 | 305304536341010 |
oct | 36550567356140 |
9 | 7421247306112 |
10 | 2110001110112 |
11 | 743934689a45 |
12 | 2a0b231292a8 |
13 | 123c8405c63c |
14 | 741a5c81c40 |
15 | 39d45244192 |
hex | 1eb45dddc60 |
2110001110112 has 24 divisors (see below), whose sum is σ = 4747502498256. Its totient is φ = 904286189952.
The previous prime is 2110001110099. The next prime is 2110001110117. The reversal of 2110001110112 is 2110111000112.
It is a junction number, because it is equal to n+sod(n) for n = 2110001110093 and 2110001110102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2110001110117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4709823683 + ... + 4709824130.
It is an arithmetic number, because the mean of its divisors is an integer number (197812604094).
Almost surely, 22110001110112 is an apocalyptic number.
It is an amenable number.
2110001110112 is an abundant number, since it is smaller than the sum of its proper divisors (2637501388144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110001110112 is an equidigital number, since it uses as much as digits as its factorization.
2110001110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9419647830 (or 9419647822 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2110001110112 its reverse (2110111000112), we get a palindrome (4220112110224).
The spelling of 2110001110112 in words is "two trillion, one hundred ten billion, one million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •