Base | Representation |
---|---|
bin | 100000001011010000100… |
… | …011010010110001110111 |
3 | 21211101021012111212011000 |
4 | 200023100203102301313 |
5 | 242211324144244111 |
6 | 4411434302014343 |
7 | 315514263525636 |
oct | 40132043226167 |
9 | 7741235455130 |
10 | 2211112103031 |
11 | 782800158507 |
12 | 2b8640b773b3 |
13 | 130678a9b530 |
14 | 790386a351d |
15 | 3c7b1c86c56 |
hex | 202d08d2c77 |
2211112103031 has 16 divisors (see below), whose sum is σ = 3527700221920. Its totient is φ = 1360684370880.
The previous prime is 2211112103017. The next prime is 2211112103033. The reversal of 2211112103031 is 1303012111122.
It is not a de Polignac number, because 2211112103031 - 218 = 2211111840887 is a prime.
It is a super-2 number, since 2×22111121030312 (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 = 2211112102995 and 2211112103013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211112103033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3149731990 + ... + 3149732691.
It is an arithmetic number, because the mean of its divisors is an integer number (220481263870).
Almost surely, 22211112103031 is an apocalyptic number.
2211112103031 is a deficient number, since it is larger than the sum of its proper divisors (1316588118889).
2211112103031 is a wasteful number, since it uses less digits than its factorization.
2211112103031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6299464703 (or 6299464697 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 2211112103031 its reverse (1303012111122), we get a palindrome (3514124214153).
The spelling of 2211112103031 in words is "two trillion, two hundred eleven billion, one hundred twelve million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •