Base | Representation |
---|---|
bin | 1100001110010111000… |
… | …0011001100001010101 |
3 | 202002002011200212121022 |
4 | 3003211300121201111 |
5 | 11420101323200432 |
6 | 240251221330525 |
7 | 21113214616502 |
oct | 3034560314125 |
9 | 662064625538 |
10 | 210013100117 |
11 | 8107aa13557 |
12 | 34850b66a45 |
13 | 16a5b9452a2 |
14 | a243c944a9 |
15 | 56e256db12 |
hex | 30e5c19855 |
210013100117 has 2 divisors, whose sum is σ = 210013100118. Its totient is φ = 210013100116.
The previous prime is 210013100113. The next prime is 210013100137. The reversal of 210013100117 is 711001310012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198239548081 + 11773552036 = 445241^2 + 108506^2 .
It is a cyclic number.
It is not a de Polignac number, because 210013100117 - 22 = 210013100113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210013100095 and 210013100104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210013100113) 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, 105006550058 + 105006550059.
It is an arithmetic number, because the mean of its divisors is an integer number (105006550059).
Almost surely, 2210013100117 is an apocalyptic number.
It is an amenable number.
210013100117 is a deficient number, since it is larger than the sum of its proper divisors (1).
210013100117 is an equidigital number, since it uses as much as digits as its factorization.
210013100117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 17.
Adding to 210013100117 its reverse (711001310012), we get a palindrome (921014410129).
The spelling of 210013100117 in words is "two hundred ten billion, thirteen million, one hundred thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •