Base | Representation |
---|---|
bin | 11101010000001001011… |
… | …000011101010111001101 |
3 | 21010011200102220021210222 |
4 | 131100021120131113031 |
5 | 230413343214214242 |
6 | 4135250223241125 |
7 | 265142452635233 |
oct | 35201130352715 |
9 | 7104612807728 |
10 | 2010202101197 |
11 | 705581753484 |
12 | 2857107491a5 |
13 | 11773b093344 |
14 | 6d4197c0953 |
15 | 374539ac5d2 |
hex | 1d40961d5cd |
2010202101197 has 2 divisors, whose sum is σ = 2010202101198. Its totient is φ = 2010202101196.
The previous prime is 2010202101169. The next prime is 2010202101223. The reversal of 2010202101197 is 7911012020102.
It is an a-pointer prime, because the next prime (2010202101223) can be obtained adding 2010202101197 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1243773640516 + 766428460681 = 1115246^2 + 875459^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010202101197 - 228 = 2009933665741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010202101997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005101050598 + 1005101050599.
It is an arithmetic number, because the mean of its divisors is an integer number (1005101050599).
Almost surely, 22010202101197 is an apocalyptic number.
It is an amenable number.
2010202101197 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010202101197 is an equidigital number, since it uses as much as digits as its factorization.
2010202101197 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 26.
Adding to 2010202101197 its reverse (7911012020102), we get a palindrome (9921214121299).
The spelling of 2010202101197 in words is "two trillion, ten billion, two hundred two million, one hundred one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •