Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0011011010000010100101 |
3 | 1102222122022120222101102121 |
4 | 2200032302303122002211 |
5 | 2420401012224000401 |
6 | 35230214541105541 |
7 | 2214342604143034 |
oct | 240166263320245 |
9 | 42878276871377 |
10 | 11011001000101 |
11 | 3565815010133 |
12 | 129a009b582b1 |
13 | 61b44360b97b |
14 | 2a0d1462671b |
15 | 14164c394ca1 |
hex | a03b2cda0a5 |
11011001000101 has 2 divisors, whose sum is σ = 11011001000102. Its totient is φ = 11011001000100.
The previous prime is 11011001000071. The next prime is 11011001000149. The reversal of 11011001000101 is 10100010011011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5711497735876 + 5299503264225 = 2389874^2 + 2302065^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011001000101 - 213 = 11011000991909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011001000191) 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, 5505500500050 + 5505500500051.
It is an arithmetic number, because the mean of its divisors is an integer number (5505500500051).
Almost surely, 211011001000101 is an apocalyptic number.
It is an amenable number.
11011001000101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011001000101 is an equidigital number, since it uses as much as digits as its factorization.
11011001000101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11011001000101 its reverse (10100010011011), we get a palindrome (21111011011112).
The spelling of 11011001000101 in words is "eleven trillion, eleven billion, one million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •