Base | Representation |
---|---|
bin | 1010000000010111000100… |
… | …1011100011111000010011 |
3 | 1102221201022012211201001002 |
4 | 2200011301023203320103 |
5 | 2420221140341213021 |
6 | 35221533155332215 |
7 | 2213550501643646 |
oct | 240056113437023 |
9 | 42851265751032 |
10 | 11001310101011 |
11 | 35616a182621a |
12 | 12981645b106b |
13 | 61a55a987859 |
14 | 2a0675565a5d |
15 | 1412816e250b |
hex | a01712e3e13 |
11001310101011 has 2 divisors, whose sum is σ = 11001310101012. Its totient is φ = 11001310101010.
The previous prime is 11001310100939. The next prime is 11001310101043. The reversal of 11001310101011 is 11010101310011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001310101011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11001310100983 and 11001310101001.
It is not a weakly prime, because it can be changed into another prime (11001310151011) 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, 5500655050505 + 5500655050506.
It is an arithmetic number, because the mean of its divisors is an integer number (5500655050506).
Almost surely, 211001310101011 is an apocalyptic number.
11001310101011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001310101011 is an equidigital number, since it uses as much as digits as its factorization.
11001310101011 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 11001310101011 its reverse (11010101310011), we get a palindrome (22011411411022).
The spelling of 11001310101011 in words is "eleven trillion, one billion, three hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •