Base | Representation |
---|---|
bin | 10100100101110110… |
… | …111101101111000001 |
3 | 2010001212212111000011 |
4 | 110211312331233001 |
5 | 330240130031423 |
6 | 14053542024521 |
7 | 1411622626363 |
oct | 244566755701 |
9 | 63055774004 |
10 | 22110002113 |
11 | 9416579921 |
12 | 4350718141 |
13 | 21148882b4 |
14 | 10da616d33 |
15 | 89610bb0d |
hex | 525dbdbc1 |
22110002113 has 4 divisors (see below), whose sum is σ = 22145042368. Its totient is φ = 22074961860.
The previous prime is 22110002107. The next prime is 22110002183. The reversal of 22110002113 is 31120001122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22110002113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22110002093 and 22110002102.
It is not an unprimeable number, because it can be changed into a prime (22110002183) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17519181 + ... + 17520442.
It is an arithmetic number, because the mean of its divisors is an integer number (5536260592).
Almost surely, 222110002113 is an apocalyptic number.
It is an amenable number.
22110002113 is a deficient number, since it is larger than the sum of its proper divisors (35040255).
22110002113 is an equidigital number, since it uses as much as digits as its factorization.
22110002113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35040254.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 22110002113 its reverse (31120001122), we get a palindrome (53230003235).
Subtracting 22110002113 from its reverse (31120001122), we obtain a palindrome (9009999009).
The spelling of 22110002113 in words is "twenty-two billion, one hundred ten million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •