Base | Representation |
---|---|
bin | 1010000111010110111001… |
… | …0000110111010110100110 |
3 | 1110101012120212102200201011 |
4 | 2201311232100313112212 |
5 | 2424203333140303014 |
6 | 35353053400052434 |
7 | 2225334432210346 |
oct | 241655620672646 |
9 | 43335525380634 |
10 | 11121520244134 |
11 | 35a8679270a43 |
12 | 12b751276411a |
13 | 6289a756ac61 |
14 | 2a63da770d26 |
15 | 144469d577c4 |
hex | a1d6e4375a6 |
11121520244134 has 4 divisors (see below), whose sum is σ = 16682280366204. Its totient is φ = 5560760122066.
The previous prime is 11121520244057. The next prime is 11121520244209. The reversal of 11121520244134 is 43144202512111.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×111215202441342 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11121520244096 and 11121520244105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2780380061032 + ... + 2780380061035.
It is an arithmetic number, because the mean of its divisors is an integer number (4170570091551).
Almost surely, 211121520244134 is an apocalyptic number.
11121520244134 is a deficient number, since it is larger than the sum of its proper divisors (5560760122070).
11121520244134 is an equidigital number, since it uses as much as digits as its factorization.
11121520244134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5560760122069.
The product of its (nonzero) digits is 7680, while the sum is 31.
Adding to 11121520244134 its reverse (43144202512111), we get a palindrome (54265722756245).
The spelling of 11121520244134 in words is "eleven trillion, one hundred twenty-one billion, five hundred twenty million, two hundred forty-four thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •