Base | Representation |
---|---|
bin | 1010000000100111000011… |
… | …10100101001100101001111 |
3 | 2212221020202110011012100111 |
4 | 11000103201310221211033 |
5 | 10341112414440200421 |
6 | 114451450045340451 |
7 | 4431154040221336 |
oct | 500234164514517 |
9 | 85836673135314 |
10 | 22011201100111 |
11 | 7016997210153 |
12 | 2575b02867727 |
13 | c388553236a2 |
14 | 5614c25a8d1d |
15 | 2828663c7ee1 |
hex | 1404e1d2994f |
22011201100111 has 8 divisors (see below), whose sum is σ = 22685126119040. Its totient is φ = 21344641382232.
The previous prime is 22011201100099. The next prime is 22011201100129. The reversal of 22011201100111 is 11100110211022.
It is a happy number.
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 22011201100111 - 25 = 22011201100079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22011201100091 and 22011201100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011201130111) 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, 1841319195 + ... + 1841331148.
It is an arithmetic number, because the mean of its divisors is an integer number (2835640764880).
Almost surely, 222011201100111 is an apocalyptic number.
22011201100111 is a deficient number, since it is larger than the sum of its proper divisors (673925018929).
22011201100111 is a wasteful number, since it uses less digits than its factorization.
22011201100111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3682650525.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 22011201100111 its reverse (11100110211022), we get a palindrome (33111311311133).
The spelling of 22011201100111 in words is "twenty-two trillion, eleven billion, two hundred one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •