Base | Representation |
---|---|
bin | 1010000011001100101011… |
… | …00101101100100110011001 |
3 | 2220020202021010000201002202 |
4 | 11001212111211230212121 |
5 | 10344042014301100423 |
6 | 115000353041335545 |
7 | 4440452326060166 |
oct | 501462545544631 |
9 | 86222233021082 |
10 | 22100116425113 |
11 | 7050674633921 |
12 | 258b1983375b5 |
13 | c440554cc52c |
14 | 5659193d706d |
15 | 284d1c3e9728 |
hex | 14199596c999 |
22100116425113 has 4 divisors (see below), whose sum is σ = 22100771257728. Its totient is φ = 22099461592500.
The previous prime is 22100116425109. The next prime is 22100116425137. The reversal of 22100116425113 is 31152461100122.
It is a happy number.
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 not a de Polignac number, because 22100116425113 - 22 = 22100116425109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (22100116425143) 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, 327365681 + ... + 327433182.
It is an arithmetic number, because the mean of its divisors is an integer number (5525192814432).
Almost surely, 222100116425113 is an apocalyptic number.
It is an amenable number.
22100116425113 is a deficient number, since it is larger than the sum of its proper divisors (654832615).
22100116425113 is an equidigital number, since it uses as much as digits as its factorization.
22100116425113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654832614.
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 22100116425113 its reverse (31152461100122), we get a palindrome (53252577525235).
The spelling of 22100116425113 in words is "twenty-two trillion, one hundred billion, one hundred sixteen million, four hundred twenty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •