Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0100011000110011010011 |
3 | 1110022020122112201012122202 |
4 | 2201202213310120303103 |
5 | 2423334332310133021 |
6 | 35335422320153415 |
7 | 2224010254534052 |
oct | 241424764306323 |
9 | 43266575635582 |
10 | 11101011021011 |
11 | 359aa0435606a |
12 | 12b354a16886b |
13 | 626a8952c182 |
14 | 2a54129b2399 |
15 | 143b69550a0b |
hex | a18a7d18cd3 |
11101011021011 has 2 divisors, whose sum is σ = 11101011021012. Its totient is φ = 11101011021010.
The previous prime is 11101011020941. The next prime is 11101011021053. The reversal of 11101011021011 is 11012011010111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101011021011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101011020983 and 11101011021001.
It is not a weakly prime, because it can be changed into another prime (11101011081011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550505510505 + 5550505510506.
It is an arithmetic number, because the mean of its divisors is an integer number (5550505510506).
Almost surely, 211101011021011 is an apocalyptic number.
11101011021011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101011021011 is an equidigital number, since it uses as much as digits as its factorization.
11101011021011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11101011021011 its reverse (11012011010111), we get a palindrome (22113022031122).
The spelling of 11101011021011 in words is "eleven trillion, one hundred one billion, eleven million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •