Base | Representation |
---|---|
bin | 1010000110001000111101… |
… | …01101001011000000111101 |
3 | 2220121102011212200210210120 |
4 | 11003010132231023000331 |
5 | 10402221024441023401 |
6 | 115115031353125153 |
7 | 4450661313530415 |
oct | 503043655130075 |
9 | 86542155623716 |
10 | 22201201111101 |
11 | 708a527274621 |
12 | 25a68a93b97b9 |
13 | c5074495a3ac |
14 | 56a78852b645 |
15 | 287786992836 |
hex | 14311eb4b03d |
22201201111101 has 4 divisors (see below), whose sum is σ = 29601601481472. Its totient is φ = 14800800740732.
The previous prime is 22201201111097. The next prime is 22201201111139. The reversal of 22201201111101 is 10111110210222.
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 22201201111101 - 22 = 22201201111097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22201201111181) 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, 3700200185181 + ... + 3700200185186.
It is an arithmetic number, because the mean of its divisors is an integer number (7400400370368).
Almost surely, 222201201111101 is an apocalyptic number.
It is an amenable number.
22201201111101 is a deficient number, since it is larger than the sum of its proper divisors (7400400370371).
22201201111101 is an equidigital number, since it uses as much as digits as its factorization.
22201201111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7400400370370.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 22201201111101 its reverse (10111110210222), we get a palindrome (32312311321323).
The spelling of 22201201111101 in words is "twenty-two trillion, two hundred one billion, two hundred one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •