Base | Representation |
---|---|
bin | 10100100001101101… |
… | …10011011011000101 |
3 | 1001110000111012000001 |
4 | 22100312303123011 |
5 | 140032134020401 |
6 | 5021305321301 |
7 | 540043216402 |
oct | 122066633305 |
9 | 31400435001 |
10 | 11020220101 |
11 | 4745699520 |
12 | 2176796231 |
13 | 1068186cc7 |
14 | 7678552a9 |
15 | 447735601 |
hex | 290db36c5 |
11020220101 has 16 divisors (see below), whose sum is σ = 12499200000. Its totient is φ = 9625417200.
The previous prime is 11020220083. The next prime is 11020220117. The reversal of 11020220101 is 10102202011.
11020220101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11020220101 - 29 = 11020219589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020223101) 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 15 ways as a sum of consecutive naturals, for example, 68851 + ... + 163648.
It is an arithmetic number, because the mean of its divisors is an integer number (781200000).
Almost surely, 211020220101 is an apocalyptic number.
11020220101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11020220101 is a deficient number, since it is larger than the sum of its proper divisors (1478979899).
11020220101 is a wasteful number, since it uses less digits than its factorization.
11020220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232680.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11020220101 its reverse (10102202011), we get a palindrome (21122422112).
The spelling of 11020220101 in words is "eleven billion, twenty million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •