Base | Representation |
---|---|
bin | 10100011111011100… |
… | …10000011000101101 |
3 | 1001101200200222101010 |
4 | 22033232100120231 |
5 | 140012301432341 |
6 | 5015345535433 |
7 | 536422450602 |
oct | 121756203055 |
9 | 31350628333 |
10 | 11001202221 |
11 | 473598a069 |
12 | 2170344579 |
13 | 1064258919 |
14 | 7651046a9 |
15 | 445c2a716 |
hex | 28fb9062d |
11001202221 has 24 divisors (see below), whose sum is σ = 15178283040. Its totient is φ = 7087448160.
The previous prime is 11001202213. The next prime is 11001202297. The reversal of 11001202221 is 12220210011.
11001202221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11001202221 - 23 = 11001202213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11001202197 and 11001202206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001202021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2387706 + ... + 2392308.
It is an arithmetic number, because the mean of its divisors is an integer number (632428460).
Almost surely, 211001202221 is an apocalyptic number.
It is an amenable number.
11001202221 is a deficient number, since it is larger than the sum of its proper divisors (4177080819).
11001202221 is an equidigital number, since it uses as much as digits as its factorization.
11001202221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5497 (or 5466 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11001202221 its reverse (12220210011), we get a palindrome (23221412232).
The spelling of 11001202221 in words is "eleven billion, one million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •