Base | Representation |
---|---|
bin | 1010001011111011101100… |
… | …1011100110001110011101 |
3 | 1110122201110121222002202220 |
4 | 2202332323023212032131 |
5 | 2432000321222321341 |
6 | 35453133020135553 |
7 | 2234116263142134 |
oct | 242767313461635 |
9 | 43581417862686 |
10 | 11200120120221 |
11 | 3628a4290421a |
12 | 130a7a96975b9 |
13 | 6332225aca86 |
14 | 2aa1355a491b |
15 | 14651a459a66 |
hex | a2fbb2e639d |
11200120120221 has 8 divisors (see below), whose sum is σ = 15178304862624. Its totient is φ = 7344341062320.
The previous prime is 11200120120207. The next prime is 11200120120271. The reversal of 11200120120221 is 12202102100211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11200120120221 - 222 = 11200115925917 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11200120120221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200120120271) 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, 30601420911 + ... + 30601421276.
It is an arithmetic number, because the mean of its divisors is an integer number (1897288107828).
Almost surely, 211200120120221 is an apocalyptic number.
It is an amenable number.
11200120120221 is a deficient number, since it is larger than the sum of its proper divisors (3978184742403).
11200120120221 is an equidigital number, since it uses as much as digits as its factorization.
11200120120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61202842251.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11200120120221 its reverse (12202102100211), we get a palindrome (23402222220432).
The spelling of 11200120120221 in words is "eleven trillion, two hundred billion, one hundred twenty million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •