Base | Representation |
---|---|
bin | 1010001011111111011011… |
… | …0010010010110110011101 |
3 | 1110122211001022122100212221 |
4 | 2202333312302102312131 |
5 | 2432004343222321341 |
6 | 35453420141425341 |
7 | 2234153125043053 |
oct | 242776662226635 |
9 | 43584038570787 |
10 | 11201120120221 |
11 | 3629406327aa9 |
12 | 130aa2856b251 |
13 | 633351819c55 |
14 | 2aa1cc3121d3 |
15 | 14657813aed1 |
hex | a2ff6c92d9d |
11201120120221 has 8 divisors (see below), whose sum is σ = 11562487683584. Its totient is φ = 10839755126160.
The previous prime is 11201120120219. The next prime is 11201120120227. The reversal of 11201120120221 is 12202102110211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11201120120221 - 21 = 11201120120219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11201120120195 and 11201120120204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201120120227) 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, 12460336 + ... + 13328998.
It is an arithmetic number, because the mean of its divisors is an integer number (1445310960448).
Almost surely, 211201120120221 is an apocalyptic number.
It is an amenable number.
11201120120221 is a deficient number, since it is larger than the sum of its proper divisors (361367563363).
11201120120221 is an equidigital number, since it uses as much as digits as its factorization.
11201120120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1284651.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11201120120221 its reverse (12202102110211), we get a palindrome (23403222230432).
The spelling of 11201120120221 in words is "eleven trillion, two hundred one billion, one hundred twenty million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •