Base | Representation |
---|---|
bin | 1010001000000110100101… |
… | …0000110000100100001101 |
3 | 1110102102121222202021001002 |
4 | 2202001221100300210031 |
5 | 2424411042213412031 |
6 | 35403011521430045 |
7 | 2226266600624162 |
oct | 242015120604415 |
9 | 43372558667032 |
10 | 11134321232141 |
11 | 3603048078778 |
12 | 12b9aa579b325 |
13 | 629c67640283 |
14 | 2a6c928d4069 |
15 | 144968a97ccb |
hex | a206943090d |
11134321232141 has 2 divisors, whose sum is σ = 11134321232142. Its totient is φ = 11134321232140.
The previous prime is 11134321232131. The next prime is 11134321232173. The reversal of 11134321232141 is 14123212343111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6735322562500 + 4398998669641 = 2595250^2 + 2097379^2 .
It is a cyclic number.
It is not a de Polignac number, because 11134321232141 - 226 = 11134254123277 is a prime.
It is a super-2 number, since 2×111343212321412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11134321232131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5567160616070 + 5567160616071.
It is an arithmetic number, because the mean of its divisors is an integer number (5567160616071).
Almost surely, 211134321232141 is an apocalyptic number.
It is an amenable number.
11134321232141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11134321232141 is an equidigital number, since it uses as much as digits as its factorization.
11134321232141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 29.
Adding to 11134321232141 its reverse (14123212343111), we get a palindrome (25257533575252).
The spelling of 11134321232141 in words is "eleven trillion, one hundred thirty-four billion, three hundred twenty-one million, two hundred thirty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •