Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …11110010111000111101101 |
3 | 2212222022011001121122112222 |
4 | 11000131301132113013231 |
5 | 10341302431441023041 |
6 | 114500505354005125 |
7 | 4432023446611106 |
oct | 500356136270755 |
9 | 85868131548488 |
10 | 22022201111021 |
11 | 7020621456161 |
12 | 25780727167a5 |
13 | c398b9252c97 |
14 | 561c4747d3ad |
15 | 282cabe6a74b |
hex | 1407717971ed |
22022201111021 has 4 divisors (see below), whose sum is σ = 22979688115872. Its totient is φ = 21064714106172.
The previous prime is 22022201110963. The next prime is 22022201111033. The reversal of 22022201111021 is 12011110222022.
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 22022201111021 - 222 = 22022196916717 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 (22022201111041) 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, 478743502391 + ... + 478743502436.
It is an arithmetic number, because the mean of its divisors is an integer number (5744922028968).
Almost surely, 222022201111021 is an apocalyptic number.
It is an amenable number.
22022201111021 is a deficient number, since it is larger than the sum of its proper divisors (957487004851).
22022201111021 is an equidigital number, since it uses as much as digits as its factorization.
22022201111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 957487004850.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 22022201111021 its reverse (12011110222022), we get a palindrome (34033311333043).
The spelling of 22022201111021 in words is "twenty-two trillion, twenty-two billion, two hundred one million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •