Base | Representation |
---|---|
bin | 1010000110001010011100… |
… | …1110001010010010100101 |
3 | 1110022020121211212002112221 |
4 | 2201202213032022102211 |
5 | 2423334322224000401 |
6 | 35335421321312341 |
7 | 2224010103416425 |
oct | 241424716122245 |
9 | 43266554762487 |
10 | 11101001000101 |
11 | 359a9a9731221 |
12 | 12b35469356b1 |
13 | 626a87430c3c |
14 | 2a5411524485 |
15 | 143b687217a1 |
hex | a18a738a4a5 |
11101001000101 has 2 divisors, whose sum is σ = 11101001000102. Its totient is φ = 11101001000100.
The previous prime is 11101001000077. The next prime is 11101001000113. The reversal of 11101001000101 is 10100010010111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6208698459076 + 4892302541025 = 2491726^2 + 2211855^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101001000101 - 29 = 11101000999589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101001003101) 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, 5550500500050 + 5550500500051.
It is an arithmetic number, because the mean of its divisors is an integer number (5550500500051).
Almost surely, 211101001000101 is an apocalyptic number.
It is an amenable number.
11101001000101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101001000101 is an equidigital number, since it uses as much as digits as its factorization.
11101001000101 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 11101001000101 its reverse (10100010010111), we get a palindrome (21201011010212).
The spelling of 11101001000101 in words is "eleven trillion, one hundred one billion, one million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •