Base | Representation |
---|---|
bin | 1011111010101001100000… |
… | …1010000010001101010101 |
3 | 1201101120002001111212222212 |
4 | 2332222120022002031111 |
5 | 3204131302433120432 |
6 | 43511022522003205 |
7 | 2521413543055151 |
oct | 276523012021525 |
9 | 51346061455885 |
10 | 13102203020117 |
11 | 41a1682038482 |
12 | 1577365346505 |
13 | 7406bca16053 |
14 | 3342158ac061 |
15 | 17ac41ed82b2 |
hex | bea98282355 |
13102203020117 has 2 divisors, whose sum is σ = 13102203020118. Its totient is φ = 13102203020116.
The previous prime is 13102203020063. The next prime is 13102203020317. The reversal of 13102203020117 is 71102030220131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10001191201156 + 3101011818961 = 3162466^2 + 1760969^2 .
It is a cyclic number.
It is not a de Polignac number, because 13102203020117 - 210 = 13102203019093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13102203020092 and 13102203020101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13102203020317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551101510058 + 6551101510059.
It is an arithmetic number, because the mean of its divisors is an integer number (6551101510059).
Almost surely, 213102203020117 is an apocalyptic number.
It is an amenable number.
13102203020117 is a deficient number, since it is larger than the sum of its proper divisors (1).
13102203020117 is an equidigital number, since it uses as much as digits as its factorization.
13102203020117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 13102203020117 its reverse (71102030220131), we get a palindrome (84204233240248).
The spelling of 13102203020117 in words is "thirteen trillion, one hundred two billion, two hundred three million, twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •