Base | Representation |
---|---|
bin | 1001001000111111010111… |
… | …00001001000101101110101 |
3 | 2122011112212202111112212001 |
4 | 10210133223201020231311 |
5 | 10113310002421411242 |
6 | 110425505431255301 |
7 | 4143120204100201 |
oct | 444375341105565 |
9 | 78145782445761 |
10 | 20100103310197 |
11 | 644a451345669 |
12 | 230764bb1a531 |
13 | b2a57c325871 |
14 | 4d6bc8cd1b01 |
15 | 24ccb31caeb7 |
hex | 1247eb848b75 |
20100103310197 has 2 divisors, whose sum is σ = 20100103310198. Its totient is φ = 20100103310196.
The previous prime is 20100103310101. The next prime is 20100103310251. The reversal of 20100103310197 is 79101330100102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17634280063761 + 2465823246436 = 4199319^2 + 1570294^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20100103310197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20100103310797) 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, 10050051655098 + 10050051655099.
It is an arithmetic number, because the mean of its divisors is an integer number (10050051655099).
Almost surely, 220100103310197 is an apocalyptic number.
It is an amenable number.
20100103310197 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100103310197 is an equidigital number, since it uses as much as digits as its factorization.
20100103310197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 28.
Adding to 20100103310197 its reverse (79101330100102), we get a palindrome (99201433410299).
The spelling of 20100103310197 in words is "twenty trillion, one hundred billion, one hundred three million, three hundred ten thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •