Base | Representation |
---|---|
bin | 1010000011100011001011… |
… | …11100111001000101110111 |
3 | 2220021220110101100122211022 |
4 | 11001301211330321011313 |
5 | 10344241242214213421 |
6 | 115010112211331355 |
7 | 4441360660450163 |
oct | 501614574710567 |
9 | 86256411318738 |
10 | 22112202101111 |
11 | 7055806693101 |
12 | 25915ab8b0b5b |
13 | c45230330ac5 |
14 | 566344557ca3 |
15 | 2852c84407ab |
hex | 141c65f39177 |
22112202101111 has 8 divisors (see below), whose sum is σ = 22120896373248. Its totient is φ = 22103508231000.
The previous prime is 22112202101083. The next prime is 22112202101177. The reversal of 22112202101111 is 11110120221122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22112202101111 - 238 = 21837324194167 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22112202101111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22112202100111) 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, 157794206 + ... + 157934276.
It is an arithmetic number, because the mean of its divisors is an integer number (2765112046656).
Almost surely, 222112202101111 is an apocalyptic number.
22112202101111 is a deficient number, since it is larger than the sum of its proper divisors (8694272137).
22112202101111 is a wasteful number, since it uses less digits than its factorization.
22112202101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201013.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 22112202101111 its reverse (11110120221122), we get a palindrome (33222322322233).
The spelling of 22112202101111 in words is "twenty-two trillion, one hundred twelve billion, two hundred two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •