Base | Representation |
---|---|
bin | 1001001001000011010010… |
… | …01101001100010010111101 |
3 | 2122011202022201101122211002 |
4 | 10210201221031030102331 |
5 | 10113323312233324242 |
6 | 110430455000140045 |
7 | 4143223360543421 |
oct | 444415115142275 |
9 | 78152281348732 |
10 | 20102212011197 |
11 | 6450333686968 |
12 | 2307b3a167625 |
13 | b2a82716bc34 |
14 | 4d6d48da4b81 |
15 | 24cd883b1432 |
hex | 12486934c4bd |
20102212011197 has 2 divisors, whose sum is σ = 20102212011198. Its totient is φ = 20102212011196.
The previous prime is 20102212011127. The next prime is 20102212011251. The reversal of 20102212011197 is 79111021220102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10180253803801 + 9921958207396 = 3190651^2 + 3149914^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102212011197 - 244 = 2510025966781 is a prime.
It is a super-2 number, since 2×201022120111972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20102212011127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051106005598 + 10051106005599.
It is an arithmetic number, because the mean of its divisors is an integer number (10051106005599).
Almost surely, 220102212011197 is an apocalyptic number.
It is an amenable number.
20102212011197 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102212011197 is an equidigital number, since it uses as much as digits as its factorization.
20102212011197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008, while the sum is 29.
Adding to 20102212011197 its reverse (79111021220102), we get a palindrome (99213233231299).
The spelling of 20102212011197 in words is "twenty trillion, one hundred two billion, two hundred twelve million, eleven thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •