Base | Representation |
---|---|
bin | 1001010010010111101100… |
… | …0000111010100110100101 |
3 | 1100011011220011100210011122 |
4 | 2110211323000322212211 |
5 | 2314300014440201242 |
6 | 33414543325343325 |
7 | 2102510040153146 |
oct | 224457300724645 |
9 | 40134804323148 |
10 | 10211201100197 |
11 | 32876008a7619 |
12 | 118abba707b45 |
13 | 590bb1c53026 |
14 | 274320aabacd |
15 | 12a93b92bad2 |
hex | 9497b03a9a5 |
10211201100197 has 2 divisors, whose sum is σ = 10211201100198. Its totient is φ = 10211201100196.
The previous prime is 10211201100041. The next prime is 10211201100227. The reversal of 10211201100197 is 79100110211201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10147225491841 + 63975608356 = 3185471^2 + 252934^2 .
It is a cyclic number.
It is not a de Polignac number, because 10211201100197 - 210 = 10211201099173 is a prime.
It is a super-3 number, since 3×102112011001973 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10211201103197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105600550098 + 5105600550099.
It is an arithmetic number, because the mean of its divisors is an integer number (5105600550099).
Almost surely, 210211201100197 is an apocalyptic number.
It is an amenable number.
10211201100197 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211201100197 is an equidigital number, since it uses as much as digits as its factorization.
10211201100197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 26.
Adding to 10211201100197 its reverse (79100110211201), we get a palindrome (89311311311398).
The spelling of 10211201100197 in words is "ten trillion, two hundred eleven billion, two hundred one million, one hundred thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •