Base | Representation |
---|---|
bin | 10000000010011010011… |
… | …001011111100111001001 |
3 | 10220100201101100112120011 |
4 | 100002122121133213021 |
5 | 121024101103031441 |
6 | 2202144302431521 |
7 | 142424054310421 |
oct | 20023231374711 |
9 | 3810641315504 |
10 | 1102102002121 |
11 | 39544293732a |
12 | 1597178925a1 |
13 | 7cc0a417503 |
14 | 3b4b0715481 |
15 | 1da052b1581 |
hex | 1009a65f9c9 |
1102102002121 has 2 divisors, whose sum is σ = 1102102002122. Its totient is φ = 1102102002120.
The previous prime is 1102102002091. The next prime is 1102102002191. The reversal of 1102102002121 is 1212002012011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 944465210896 + 157636791225 = 971836^2 + 397035^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102102002121 is a prime.
It is not a weakly prime, because it can be changed into another prime (1102102002191) 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, 551051001060 + 551051001061.
It is an arithmetic number, because the mean of its divisors is an integer number (551051001061).
Almost surely, 21102102002121 is an apocalyptic number.
It is an amenable number.
1102102002121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102102002121 is an equidigital number, since it uses as much as digits as its factorization.
1102102002121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1102102002121 its reverse (1212002012011), we get a palindrome (2314104014132).
The spelling of 1102102002121 in words is "one trillion, one hundred two billion, one hundred two million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •