Base | Representation |
---|---|
bin | 10100111001100010… |
… | …10111011000001101 |
3 | 1001221221122012121210 |
4 | 22130301113120031 |
5 | 140434322333401 |
6 | 5053210045033 |
7 | 545021312220 |
oct | 123461273015 |
9 | 31857565553 |
10 | 11220121101 |
11 | 4838514062 |
12 | 2211719779 |
13 | 109a708217 |
14 | 78620d5b7 |
15 | 45a0704d6 |
hex | 29cc5760d |
11220121101 has 16 divisors (see below), whose sum is σ = 17100228224. Its totient is φ = 6410409984.
The previous prime is 11220121051. The next prime is 11220121103. The reversal of 11220121101 is 10112102211.
11220121101 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 11220121101 - 27 = 11220120973 is a prime.
It is a super-2 number, since 2×112201211012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11220121103) 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, 90921 + ... + 175233.
It is an arithmetic number, because the mean of its divisors is an integer number (1068764264).
Almost surely, 211220121101 is an apocalyptic number.
It is an amenable number.
11220121101 is a deficient number, since it is larger than the sum of its proper divisors (5880107123).
11220121101 is an equidigital number, since it uses as much as digits as its factorization.
11220121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90660.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11220121101 its reverse (10112102211), we get a palindrome (21332223312).
The spelling of 11220121101 in words is "eleven billion, two hundred twenty million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •