Base | Representation |
---|---|
bin | 10100100001101100… |
… | …00101010010010001 |
3 | 1001110000010120202210 |
4 | 22100312011102101 |
5 | 140032111443441 |
6 | 5021301302333 |
7 | 540041501421 |
oct | 122066052221 |
9 | 31400116683 |
10 | 11020031121 |
11 | 474557a540 |
12 | 21767049a9 |
13 | 106811bc98 |
14 | 767806481 |
15 | 4476e9616 |
hex | 290d85491 |
11020031121 has 16 divisors (see below), whose sum is σ = 16037258688. Its totient is φ = 6675422400.
The previous prime is 11020031083. The next prime is 11020031131. The reversal of 11020031121 is 12113002011.
It is not a de Polignac number, because 11020031121 - 27 = 11020030993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020031097 and 11020031106.
It is not an unprimeable number, because it can be changed into a prime (11020031131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17710 + ... + 149511.
It is an arithmetic number, because the mean of its divisors is an integer number (1002328668).
Almost surely, 211020031121 is an apocalyptic number.
11020031121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11020031121 is a deficient number, since it is larger than the sum of its proper divisors (5017227567).
11020031121 is a wasteful number, since it uses less digits than its factorization.
11020031121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169232.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 11020031121 its reverse (12113002011), we get a palindrome (23133033132).
The spelling of 11020031121 in words is "eleven billion, twenty million, thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •