Base | Representation |
---|---|
bin | 1010000111111010101100… |
… | …1110101000001001001001 |
3 | 1110102010101210112101220212 |
4 | 2201332223032220021021 |
5 | 2424333030022033223 |
6 | 35401323310530505 |
7 | 2226124565255402 |
oct | 241765316501111 |
9 | 43363353471825 |
10 | 11131133002313 |
11 | 3601761434495 |
12 | 12b9355b06a35 |
13 | 629879c62c4c |
14 | 2a6a6d2d09a9 |
15 | 14482dc22278 |
hex | a1fab3a8249 |
11131133002313 has 2 divisors, whose sum is σ = 11131133002314. Its totient is φ = 11131133002312.
The previous prime is 11131133002309. The next prime is 11131133002331. The reversal of 11131133002313 is 31320033113111.
Together with next prime (11131133002331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8546986731529 + 2584146270784 = 2923523^2 + 1607528^2 .
It is a cyclic number.
It is not a de Polignac number, because 11131133002313 - 22 = 11131133002309 is a prime.
It is not a weakly prime, because it can be changed into another prime (11131133002513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565566501156 + 5565566501157.
It is an arithmetic number, because the mean of its divisors is an integer number (5565566501157).
Almost surely, 211131133002313 is an apocalyptic number.
It is an amenable number.
11131133002313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11131133002313 is an equidigital number, since it uses as much as digits as its factorization.
11131133002313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 11131133002313 its reverse (31320033113111), we get a palindrome (42451166115424).
The spelling of 11131133002313 in words is "eleven trillion, one hundred thirty-one billion, one hundred thirty-three million, two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •