Base | Representation |
---|---|
bin | 1010000110001010101010… |
… | …11110110101100010100001 |
3 | 2220121111112220221021120111 |
4 | 11003011111132311202201 |
5 | 10402224420221200001 |
6 | 115115302502211321 |
7 | 4451023143024352 |
oct | 503052536654241 |
9 | 86544486837514 |
10 | 22202120100001 |
11 | 708a958a96586 |
12 | 25a6b05123b41 |
13 | c50860171bca |
14 | 56a8345cbd29 |
15 | 2877dc4c0851 |
hex | 1431557b58a1 |
22202120100001 has 4 divisors (see below), whose sum is σ = 22578427220400. Its totient is φ = 21825812979604.
The previous prime is 22202120099969. The next prime is 22202120100047. The reversal of 22202120100001 is 10000102120222.
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 22202120100001 - 25 = 22202120099969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22202120104001) 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, 188153560111 + ... + 188153560228.
It is an arithmetic number, because the mean of its divisors is an integer number (5644606805100).
Almost surely, 222202120100001 is an apocalyptic number.
It is an amenable number.
22202120100001 is a deficient number, since it is larger than the sum of its proper divisors (376307120399).
22202120100001 is an equidigital number, since it uses as much as digits as its factorization.
22202120100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376307120398.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 22202120100001 its reverse (10000102120222), we get a palindrome (32202222220223).
The spelling of 22202120100001 in words is "twenty-two trillion, two hundred two billion, one hundred twenty million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •