Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …1100000010101000010101 |
3 | 1100010010001001220202122222 |
4 | 2110123200230002220111 |
5 | 2314104121113032242 |
6 | 33405454142432125 |
7 | 2101633024326536 |
oct | 224334054025025 |
9 | 40103031822588 |
10 | 10200022002197 |
11 | 3282894562855 |
12 | 11889ba892645 |
13 | 58cb1cbac241 |
14 | 2739800da68d |
15 | 12a4d52b15d2 |
hex | 946e0b02a15 |
10200022002197 has 2 divisors, whose sum is σ = 10200022002198. Its totient is φ = 10200022002196.
The previous prime is 10200022002193. The next prime is 10200022002253. The reversal of 10200022002197 is 79120022000201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10045090021201 + 154931980996 = 3169399^2 + 393614^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200022002197 - 22 = 10200022002193 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10200022002193) 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, 5100011001098 + 5100011001099.
It is an arithmetic number, because the mean of its divisors is an integer number (5100011001099).
Almost surely, 210200022002197 is an apocalyptic number.
It is an amenable number.
10200022002197 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200022002197 is an equidigital number, since it uses as much as digits as its factorization.
10200022002197 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 26.
Adding to 10200022002197 its reverse (79120022000201), we get a palindrome (89320044002398).
The spelling of 10200022002197 in words is "ten trillion, two hundred billion, twenty-two million, two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •