Base | Representation |
---|---|
bin | 1010001000000110100000… |
… | …1111100010001111101001 |
3 | 1110102102120210120120222002 |
4 | 2202001220033202033221 |
5 | 2424411023324242441 |
6 | 35403010111140345 |
7 | 2226266302402550 |
oct | 242015017421751 |
9 | 43372523516862 |
10 | 11134304134121 |
11 | 360303945a783 |
12 | 12b9a9bb146b5 |
13 | 629c63c349bc |
14 | 2a6c90522d97 |
15 | 14496731bb9b |
hex | a20683e23e9 |
11134304134121 has 64 divisors (see below), whose sum is σ = 14317094891520. Its totient is φ = 8429150822400.
The previous prime is 11134304134103. The next prime is 11134304134127. The reversal of 11134304134121 is 12143140343111.
It is not a de Polignac number, because 11134304134121 - 222 = 11134299939817 is a prime.
It is a super-2 number, since 2×111343041341212 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11134304134127) 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 63 ways as a sum of consecutive naturals, for example, 120471890 + ... + 120564276.
It is an arithmetic number, because the mean of its divisors is an integer number (223704607680).
Almost surely, 211134304134121 is an apocalyptic number.
It is an amenable number.
11134304134121 is a deficient number, since it is larger than the sum of its proper divisors (3182790757399).
11134304134121 is a wasteful number, since it uses less digits than its factorization.
11134304134121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92934.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 11134304134121 its reverse (12143140343111), we get a palindrome (23277444477232).
The spelling of 11134304134121 in words is "eleven trillion, one hundred thirty-four billion, three hundred four million, one hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •