Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …0111010100100100101011 |
3 | 1022210111201001100010220202 |
4 | 2103013223213110210223 |
5 | 2311120300304014011 |
6 | 33300250330342415 |
7 | 2062265332414106 |
oct | 223075347244453 |
9 | 38714631303822 |
10 | 10110011001131 |
11 | 32486a4708478 |
12 | 117347a28aa0b |
13 | 5844a6a07872 |
14 | 26d48197773d |
15 | 127eb7eb023b |
hex | 931eb9d492b |
10110011001131 has 2 divisors, whose sum is σ = 10110011001132. Its totient is φ = 10110011001130.
The previous prime is 10110011001071. The next prime is 10110011001137. The reversal of 10110011001131 is 13110011001101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10110011001131 - 210 = 10110011000107 is a prime.
It is a super-2 number, since 2×101100110011312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10110011001137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055005500565 + 5055005500566.
It is an arithmetic number, because the mean of its divisors is an integer number (5055005500566).
Almost surely, 210110011001131 is an apocalyptic number.
10110011001131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110011001131 is an equidigital number, since it uses as much as digits as its factorization.
10110011001131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 10110011001131 its reverse (13110011001101), we get a palindrome (23220022002232).
The spelling of 10110011001131 in words is "ten trillion, one hundred ten billion, eleven million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •