Base | Representation |
---|---|
bin | 1010000001011101001001… |
… | …0110011001101111011001 |
3 | 1110000111212010100211222112 |
4 | 2200113102112121233121 |
5 | 2421023201232432301 |
6 | 35234323501202105 |
7 | 2215114565113055 |
oct | 240272226315731 |
9 | 43014763324875 |
10 | 11020120202201 |
11 | 35696746186a0 |
12 | 129b933b60335 |
13 | 61c267996946 |
14 | 2a153b7cac65 |
15 | 1419d2c6a9bb |
hex | a05d2599bd9 |
11020120202201 has 32 divisors (see below), whose sum is σ = 12253927200768. Its totient is φ = 9826302119040.
The previous prime is 11020120202173. The next prime is 11020120202209. The reversal of 11020120202201 is 10220202102011.
11020120202201 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 11020120202201 - 234 = 11002940333017 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11020120202209) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 417304940 + ... + 417331346.
It is an arithmetic number, because the mean of its divisors is an integer number (382935225024).
Almost surely, 211020120202201 is an apocalyptic number.
11020120202201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11020120202201 is a deficient number, since it is larger than the sum of its proper divisors (1233806998567).
11020120202201 is a wasteful number, since it uses less digits than its factorization.
11020120202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28901.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11020120202201 its reverse (10220202102011), we get a palindrome (21240322304212).
The spelling of 11020120202201 in words is "eleven trillion, twenty billion, one hundred twenty million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •