Base | Representation |
---|---|
bin | 1010000110001010011100… |
… | …1110001010100001000111 |
3 | 1110022020121211212010211101 |
4 | 2201202213032022201013 |
5 | 2423334322224013111 |
6 | 35335421321320531 |
7 | 2224010103422224 |
oct | 241424716124107 |
9 | 43266554763741 |
10 | 11101001001031 |
11 | 359a9a9731997 |
12 | 12b3546936147 |
13 | 626a874314a6 |
14 | 2a541152494b |
15 | 143b68721bc1 |
hex | a18a738a847 |
11101001001031 has 2 divisors, whose sum is σ = 11101001001032. Its totient is φ = 11101001001030.
The previous prime is 11101001001007. The next prime is 11101001001037. The reversal of 11101001001031 is 13010010010111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11101001001031 - 215 = 11101000968263 is a prime.
It is a super-2 number, since 2×111010010010312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11101001000999 and 11101001001017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101001001037) 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, 5550500500515 + 5550500500516.
It is an arithmetic number, because the mean of its divisors is an integer number (5550500500516).
Almost surely, 211101001001031 is an apocalyptic number.
11101001001031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101001001031 is an equidigital number, since it uses as much as digits as its factorization.
11101001001031 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 10.
Adding to 11101001001031 its reverse (13010010010111), we get a palindrome (24111011011142).
The spelling of 11101001001031 in words is "eleven trillion, one hundred one billion, one million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.507 sec. • engine limits •