Base | Representation |
---|---|
bin | 1010000111010101000100… |
… | …1000001100111100010101 |
3 | 1110101011022210122120021022 |
4 | 2201311101020030330111 |
5 | 2424201333021342010 |
6 | 35352533055130525 |
7 | 2225316345330053 |
oct | 241652110147425 |
9 | 43334283576238 |
10 | 11121031434005 |
11 | 35a8448357729 |
12 | 12b73b6b13a45 |
13 | 62892a2031ac |
14 | 2a639188d1d3 |
15 | 14443be9ed55 |
hex | a1d5120cf15 |
11121031434005 has 16 divisors (see below), whose sum is σ = 14178904822080. Its totient is φ = 8349799491072.
The previous prime is 11121031434001. The next prime is 11121031434011. The reversal of 11121031434005 is 50043413012111.
It is a cyclic number.
It is not a de Polignac number, because 11121031434005 - 22 = 11121031434001 is a prime.
It is a super-2 number, since 2×111210314340052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121031434001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 547015484 + ... + 547035813.
It is an arithmetic number, because the mean of its divisors is an integer number (886181551380).
Almost surely, 211121031434005 is an apocalyptic number.
It is an amenable number.
11121031434005 is a deficient number, since it is larger than the sum of its proper divisors (3057873388075).
11121031434005 is a wasteful number, since it uses less digits than its factorization.
11121031434005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1094051428.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 11121031434005 its reverse (50043413012111), we get a palindrome (61164444446116).
The spelling of 11121031434005 in words is "eleven trillion, one hundred twenty-one billion, thirty-one million, four hundred thirty-four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •