Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …0011110101101001111011 |
3 | 1022110001101202212020112202 |
4 | 2101223210003311221323 |
5 | 2303010213100324011 |
6 | 33143011424500415 |
7 | 2052164251026632 |
oct | 221534403655173 |
9 | 38401352766482 |
10 | 10011100011131 |
11 | 320a757a7073a |
12 | 115827517a70b |
13 | 5780729cb74b |
14 | 26877b3d4519 |
15 | 12562968a23b |
hex | 91ae40f5a7b |
10011100011131 has 2 divisors, whose sum is σ = 10011100011132. Its totient is φ = 10011100011130.
The previous prime is 10011100011089. The next prime is 10011100011137. The reversal of 10011100011131 is 13111000111001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10011100011131 - 226 = 10011032902267 is a prime.
It is a super-2 number, since 2×100111000111312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10011100011137) 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, 5005550005565 + 5005550005566.
It is an arithmetic number, because the mean of its divisors is an integer number (5005550005566).
Almost surely, 210011100011131 is an apocalyptic number.
10011100011131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011100011131 is an equidigital number, since it uses as much as digits as its factorization.
10011100011131 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 10011100011131 its reverse (13111000111001), we get a palindrome (23122100122132).
The spelling of 10011100011131 in words is "ten trillion, eleven billion, one hundred million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •