Base | Representation |
---|---|
bin | 1010010010010101001010… |
… | …0000011101101001101001 |
3 | 1111001020011122200121221002 |
4 | 2210211102200131221221 |
5 | 2440300421440212022 |
6 | 40015431341324345 |
7 | 2245060110263045 |
oct | 244452240355151 |
9 | 44036148617832 |
10 | 11310033132137 |
11 | 367061593a953 |
12 | 1327b632666b5 |
13 | 6406baa7092c |
14 | 2b15a0dc3025 |
15 | 1492eeabd092 |
hex | a495281da69 |
11310033132137 has 2 divisors, whose sum is σ = 11310033132138. Its totient is φ = 11310033132136.
The previous prime is 11310033132071. The next prime is 11310033132157. The reversal of 11310033132137 is 73123133001311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9575831226256 + 1734201905881 = 3094484^2 + 1316891^2 .
It is a cyclic number.
It is not a de Polignac number, because 11310033132137 - 214 = 11310033115753 is a prime.
It is not a weakly prime, because it can be changed into another prime (11310033132157) 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 as a sum of consecutive naturals, namely, 5655016566068 + 5655016566069.
It is an arithmetic number, because the mean of its divisors is an integer number (5655016566069).
Almost surely, 211310033132137 is an apocalyptic number.
It is an amenable number.
11310033132137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11310033132137 is an equidigital number, since it uses as much as digits as its factorization.
11310033132137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402, while the sum is 29.
Adding to 11310033132137 its reverse (73123133001311), we get a palindrome (84433166133448).
The spelling of 11310033132137 in words is "eleven trillion, three hundred ten billion, thirty-three million, one hundred thirty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •