Base | Representation |
---|---|
bin | 1010000000110111101000… |
… | …01111101001001110001001 |
3 | 2212222002201122012021122001 |
4 | 11000123310033221032021 |
5 | 10341234131111213001 |
6 | 114455521102031001 |
7 | 4431620415406342 |
oct | 500336417511611 |
9 | 85862648167561 |
10 | 22020100101001 |
11 | 701a743498242 |
12 | 2577786b78461 |
13 | c39642ba04a2 |
14 | 561ac840d0c9 |
15 | 282bd77a4001 |
hex | 1406f43e9389 |
22020100101001 has 4 divisors (see below), whose sum is σ = 22099595047492. Its totient is φ = 21940605154512.
The previous prime is 22020100100987. The next prime is 22020100101011. The reversal of 22020100101001 is 10010100102022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14142872011401 + 7877228089600 = 3760701^2 + 2806640^2 .
It is a cyclic number.
It is not a de Polignac number, because 22020100101001 - 217 = 22020099969929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22020100101011) 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, 39747472830 + ... + 39747473383.
It is an arithmetic number, because the mean of its divisors is an integer number (5524898761873).
Almost surely, 222020100101001 is an apocalyptic number.
It is an amenable number.
22020100101001 is a deficient number, since it is larger than the sum of its proper divisors (79494946491).
22020100101001 is an equidigital number, since it uses as much as digits as its factorization.
22020100101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79494946490.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 22020100101001 its reverse (10010100102022), we get a palindrome (32030200203023).
The spelling of 22020100101001 in words is "twenty-two trillion, twenty billion, one hundred million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •