Base | Representation |
---|---|
bin | 10000000010100000001… |
… | …111101101110001111101 |
3 | 10220100222012221112022111 |
4 | 100002200033231301331 |
5 | 121024301211231023 |
6 | 2202202125214021 |
7 | 142426355200063 |
oct | 20024017556175 |
9 | 3810865845274 |
10 | 1102200102013 |
11 | 39549325021a |
12 | 159744701311 |
13 | 7cc2484419a |
14 | 3b4bd770033 |
15 | 1da0dbdd00d |
hex | 100a03edc7d |
1102200102013 has 2 divisors, whose sum is σ = 1102200102014. Its totient is φ = 1102200102012.
The previous prime is 1102200101993. The next prime is 1102200102019. The reversal of 1102200102013 is 3102010022011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 907298160484 + 194901941529 = 952522^2 + 441477^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102200102013 - 233 = 1093610167421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102200101984 and 1102200102002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102200102019) 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, 551100051006 + 551100051007.
It is an arithmetic number, because the mean of its divisors is an integer number (551100051007).
Almost surely, 21102200102013 is an apocalyptic number.
It is an amenable number.
1102200102013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102200102013 is an equidigital number, since it uses as much as digits as its factorization.
1102200102013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1102200102013 its reverse (3102010022011), we get a palindrome (4204210124024).
The spelling of 1102200102013 in words is "one trillion, one hundred two billion, two hundred million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •