Base | Representation |
---|---|
bin | 1010000010010001011000… |
… | …1011101001000110110011 |
3 | 1110001212001101222121020210 |
4 | 2200210112023221012303 |
5 | 2421240411120243011 |
6 | 35245003153235203 |
7 | 2216122232061405 |
oct | 240442613510663 |
9 | 43055041877223 |
10 | 11034143134131 |
11 | 3574610159a37 |
12 | 12a25a8262b03 |
13 | 620690c745c0 |
14 | 2a20abd52b75 |
15 | 142053dcd6a6 |
hex | a09162e91b3 |
11034143134131 has 32 divisors (see below), whose sum is σ = 16355367196672. Its totient is φ = 6571050842880.
The previous prime is 11034143134123. The next prime is 11034143134153. The reversal of 11034143134131 is 13143134143011.
It is not a de Polignac number, because 11034143134131 - 23 = 11034143134123 is a prime.
It is a super-2 number, since 2×110341431341312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11034143134121) 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 31 ways as a sum of consecutive naturals, for example, 74403951 + ... + 74552103.
It is an arithmetic number, because the mean of its divisors is an integer number (511105224896).
Almost surely, 211034143134131 is an apocalyptic number.
11034143134131 is a deficient number, since it is larger than the sum of its proper divisors (5321224062541).
11034143134131 is a wasteful number, since it uses less digits than its factorization.
11034143134131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209803.
The product of its (nonzero) digits is 5184, while the sum is 30.
Adding to 11034143134131 its reverse (13143134143011), we get a palindrome (24177277277142).
The spelling of 11034143134131 in words is "eleven trillion, thirty-four billion, one hundred forty-three million, one hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •