Base | Representation |
---|---|
bin | 1010001101001101111101… |
… | …0111010010101001100101 |
3 | 1110201211110112220220221222 |
4 | 2203103133113102221211 |
5 | 2432331032203031041 |
6 | 35511224115350125 |
7 | 2235530425062233 |
oct | 243233727225145 |
9 | 43654415826858 |
10 | 11222202002021 |
11 | 363734451690a |
12 | 1312b308b2345 |
13 | 6353313a081a |
14 | 2ab22c17b953 |
15 | 146dadd5e74b |
hex | a34df5d2a65 |
11222202002021 has 4 divisors (see below), whose sum is σ = 11364255192000. Its totient is φ = 11080148812044.
The previous prime is 11222202001981. The next prime is 11222202002057. The reversal of 11222202002021 is 12020020222211.
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 a de Polignac number, because none of the positive numbers 2k-11222202002021 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 (11222202022021) 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, 71026594871 + ... + 71026595028.
It is an arithmetic number, because the mean of its divisors is an integer number (2841063798000).
Almost surely, 211222202002021 is an apocalyptic number.
It is an amenable number.
11222202002021 is a deficient number, since it is larger than the sum of its proper divisors (142053189979).
11222202002021 is an equidigital number, since it uses as much as digits as its factorization.
11222202002021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142053189978.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 11222202002021 its reverse (12020020222211), we get a palindrome (23242222224232).
The spelling of 11222202002021 in words is "eleven trillion, two hundred twenty-two billion, two hundred two million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •