Base | Representation |
---|---|
bin | 1010001100101011110011… |
… | …0110011001111011001011 |
3 | 1110200221210112212102202011 |
4 | 2203022330312121323023 |
5 | 2432203242423134011 |
6 | 35503110220320351 |
7 | 2235054261035434 |
oct | 243127466317313 |
9 | 43627715772664 |
10 | 11213033021131 |
11 | 36334698a9857 |
12 | 13111b20a30b7 |
13 | 6344cc907046 |
14 | 2aa9dc53a48b |
15 | 146a23e04621 |
hex | a32bcd99ecb |
11213033021131 has 2 divisors, whose sum is σ = 11213033021132. Its totient is φ = 11213033021130.
The previous prime is 11213033021051. The next prime is 11213033021143. The reversal of 11213033021131 is 13112033031211.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11213033021131 is a prime.
It is a super-2 number, since 2×112130330211312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11213033051131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606516510565 + 5606516510566.
It is an arithmetic number, because the mean of its divisors is an integer number (5606516510566).
Almost surely, 211213033021131 is an apocalyptic number.
11213033021131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11213033021131 is an equidigital number, since it uses as much as digits as its factorization.
11213033021131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11213033021131 its reverse (13112033031211), we get a palindrome (24325066052342).
The spelling of 11213033021131 in words is "eleven trillion, two hundred thirteen billion, thirty-three million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •