Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …1110011101101000101101 |
3 | 1102222122212222211110100022 |
4 | 2200032333332131220231 |
5 | 2420401440313032341 |
6 | 35230252514011525 |
7 | 2214351226502060 |
oct | 240167776355055 |
9 | 42878788743308 |
10 | 11011222002221 |
11 | 3565918838311 |
12 | 129a06bb76ba5 |
13 | 61b47a33a55c |
14 | 2a0d35b148d7 |
15 | 14166199be4b |
hex | a03bff9da2d |
11011222002221 has 8 divisors (see below), whose sum is σ = 12632102592384. Its totient is φ = 9402303630960.
The previous prime is 11011222002217. The next prime is 11011222002269. The reversal of 11011222002221 is 12220022211011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11011222002221 - 22 = 11011222002217 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11011222002221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011222004221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2990552750 + ... + 2990556431.
It is an arithmetic number, because the mean of its divisors is an integer number (1579012824048).
Almost surely, 211011222002221 is an apocalyptic number.
It is an amenable number.
11011222002221 is a deficient number, since it is larger than the sum of its proper divisors (1620880590163).
11011222002221 is an equidigital number, since it uses as much as digits as its factorization.
11011222002221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5981109451.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11011222002221 its reverse (12220022211011), we get a palindrome (23231244213232).
The spelling of 11011222002221 in words is "eleven trillion, eleven billion, two hundred twenty-two million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •