Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …100111100111110101001 |
3 | 10220011121022221021222101 |
4 | 100000210110330332221 |
5 | 121011022000201301 |
6 | 2201215541053401 |
7 | 142324012030234 |
oct | 20004424747651 |
9 | 3804538837871 |
10 | 1100121100201 |
11 | 394616754402 |
12 | 1592643b7261 |
13 | 7c982bc8bb6 |
14 | 3b3635cc41b |
15 | 1d93b422701 |
hex | 1002453cfa9 |
1100121100201 has 2 divisors, whose sum is σ = 1100121100202. Its totient is φ = 1100121100200.
The previous prime is 1100121100187. The next prime is 1100121100207. The reversal of 1100121100201 is 1020011210011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1098934986601 + 1186113600 = 1048301^2 + 34440^2 .
It is an emirp because it is prime and its reverse (1020011210011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1100121100201 - 239 = 550365286313 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100121100207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550060550100 + 550060550101.
It is an arithmetic number, because the mean of its divisors is an integer number (550060550101).
Almost surely, 21100121100201 is an apocalyptic number.
It is an amenable number.
1100121100201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100121100201 is an equidigital number, since it uses as much as digits as its factorization.
1100121100201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1100121100201 its reverse (1020011210011), we get a palindrome (2120132310212).
The spelling of 1100121100201 in words is "one trillion, one hundred billion, one hundred twenty-one million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •