Base | Representation |
---|---|
bin | 10000000010011100001… |
… | …100101110100101011101 |
3 | 10220100210111012020222222 |
4 | 100002130030232211131 |
5 | 121024131321210023 |
6 | 2202151302115125 |
7 | 142424602133162 |
oct | 20023414564535 |
9 | 3810714166888 |
10 | 1102132210013 |
11 | 395458999a2a |
12 | 159725a1baa5 |
13 | 7cc13762cc3 |
14 | 3b4b473a069 |
15 | 1da07c7bcc8 |
hex | 1009c32e95d |
1102132210013 has 2 divisors, whose sum is σ = 1102132210014. Its totient is φ = 1102132210012.
The previous prime is 1102132209989. The next prime is 1102132210019. The reversal of 1102132210013 is 3100122312011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1033845635524 + 68286574489 = 1016782^2 + 261317^2 .
It is an emirp because it is prime and its reverse (3100122312011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1102132210013 - 220 = 1102131161437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102132209973 and 1102132210000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102132210019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551066105006 + 551066105007.
It is an arithmetic number, because the mean of its divisors is an integer number (551066105007).
Almost surely, 21102132210013 is an apocalyptic number.
It is an amenable number.
1102132210013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102132210013 is an equidigital number, since it uses as much as digits as its factorization.
1102132210013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1102132210013 its reverse (3100122312011), we get a palindrome (4202254522024).
The spelling of 1102132210013 in words is "one trillion, one hundred two billion, one hundred thirty-two million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •