Base | Representation |
---|---|
bin | 1010000011001100011110… |
… | …10000001001010001101111 |
3 | 2220020201222200222110002011 |
4 | 11001212033100021101233 |
5 | 10344041310042041421 |
6 | 115000334322542051 |
7 | 4440446565322561 |
oct | 501461720112157 |
9 | 86221880873064 |
10 | 22100010112111 |
11 | 705061a620338 |
12 | 258b168807927 |
13 | c44039488429 |
14 | 565909241331 |
15 | 284d12de94e1 |
hex | 14198f40946f |
22100010112111 has 8 divisors (see below), whose sum is σ = 22116196800000. Its totient is φ = 22083824578200.
The previous prime is 22100010112109. The next prime is 22100010112153. The reversal of 22100010112111 is 11121101000122.
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 22100010112111 - 21 = 22100010112109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22100010112091 and 22100010112100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22100010112511) 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, 40091640 + ... + 40639138.
It is an arithmetic number, because the mean of its divisors is an integer number (2764524600000).
Almost surely, 222100010112111 is an apocalyptic number.
22100010112111 is a deficient number, since it is larger than the sum of its proper divisors (16186687889).
22100010112111 is a wasteful number, since it uses less digits than its factorization.
22100010112111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 576989.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 22100010112111 its reverse (11121101000122), we get a palindrome (33221111112233).
The spelling of 22100010112111 in words is "twenty-two trillion, one hundred billion, ten million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •