Base | Representation |
---|---|
bin | 1010000000100111000011… |
… | …11000111011000001000101 |
3 | 2212221020202112021002200121 |
4 | 11000103201320323001011 |
5 | 10341112420232020401 |
6 | 114451450125341541 |
7 | 4431154052564533 |
oct | 500234170730105 |
9 | 85836675232617 |
10 | 22011202220101 |
11 | 7016997905666 |
12 | 2575b031078b1 |
13 | c388556263c3 |
14 | 5614c27bb153 |
15 | 282866549ca1 |
hex | 1404e1e3b045 |
22011202220101 has 4 divisors (see below), whose sum is σ = 22043429456832. Its totient is φ = 21978974983372.
The previous prime is 22011202220099. The next prime is 22011202220131. The reversal of 22011202220101 is 10102220211022.
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 22011202220101 - 21 = 22011202220099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011202220131) 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, 16113617341 + ... + 16113618706.
It is an arithmetic number, because the mean of its divisors is an integer number (5510857364208).
Almost surely, 222011202220101 is an apocalyptic number.
It is an amenable number.
22011202220101 is a deficient number, since it is larger than the sum of its proper divisors (32227236731).
22011202220101 is an equidigital number, since it uses as much as digits as its factorization.
22011202220101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32227236730.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22011202220101 its reverse (10102220211022), we get a palindrome (32113422431123).
The spelling of 22011202220101 in words is "twenty-two trillion, eleven billion, two hundred two million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •