Base | Representation |
---|---|
bin | 1001010001101110011010… |
… | …1010010011011110010101 |
3 | 1100010010022001110212012101 |
4 | 2110123212222103132111 |
5 | 2314104322241211242 |
6 | 33405512122322101 |
7 | 2101635352146253 |
oct | 224334652233625 |
9 | 40103261425171 |
10 | 10200122210197 |
11 | 3282936086587 |
12 | 1188a28359331 |
13 | 58cb3789660a |
14 | 27398d5435d3 |
15 | 12a4ddea79b7 |
hex | 946e6a93795 |
10200122210197 has 2 divisors, whose sum is σ = 10200122210198. Its totient is φ = 10200122210196.
The previous prime is 10200122210147. The next prime is 10200122210209. The reversal of 10200122210197 is 79101222100201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10197809946801 + 2312263396 = 3193401^2 + 48086^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200122210197 - 215 = 10200122177429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10200122210107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100061105098 + 5100061105099.
It is an arithmetic number, because the mean of its divisors is an integer number (5100061105099).
Almost surely, 210200122210197 is an apocalyptic number.
It is an amenable number.
10200122210197 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200122210197 is an equidigital number, since it uses as much as digits as its factorization.
10200122210197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 28.
Adding to 10200122210197 its reverse (79101222100201), we get a palindrome (89301344310398).
The spelling of 10200122210197 in words is "ten trillion, two hundred billion, one hundred twenty-two million, two hundred ten thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •