Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …111101100010111001101 |
3 | 10220020220100110110010101 |
4 | 100001121113230113031 |
5 | 121014332304323041 |
6 | 2201444131011101 |
7 | 142355036115355 |
oct | 20013127542715 |
9 | 3806810413111 |
10 | 1101011011021 |
11 | 394a33015599 |
12 | 159472439a91 |
13 | 7ca9539c24c |
14 | 3b40987db65 |
15 | 1d98e609b31 |
hex | 100595ec5cd |
1101011011021 has 2 divisors, whose sum is σ = 1101011011022. Its totient is φ = 1101011011020.
The previous prime is 1101011010997. The next prime is 1101011011027. The reversal of 1101011011021 is 1201101101011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1027616073796 + 73394937225 = 1013714^2 + 270915^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101011011021 - 213 = 1101011002829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101011010989 and 1101011011007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101011011027) 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, 550505505510 + 550505505511.
It is an arithmetic number, because the mean of its divisors is an integer number (550505505511).
Almost surely, 21101011011021 is an apocalyptic number.
It is an amenable number.
1101011011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101011011021 is an equidigital number, since it uses as much as digits as its factorization.
1101011011021 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 10.
Adding to 1101011011021 its reverse (1201101101011), we get a palindrome (2302112112032).
The spelling of 1101011011021 in words is "one trillion, one hundred one billion, eleven million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •