Base | Representation |
---|---|
bin | 1001001001010001110100… |
… | …01000100101111111111101 |
3 | 2122012111110022211212122101 |
4 | 10210220322020211333331 |
5 | 10113440301111224242 |
6 | 110434225001345101 |
7 | 4143620564261326 |
oct | 444507210457775 |
9 | 78174408755571 |
10 | 20110012211197 |
11 | 6453676698647 |
12 | 2309556498191 |
13 | b2b49b197aac |
14 | 4d7488cdd44d |
15 | 24d1930919b7 |
hex | 124a3a225ffd |
20110012211197 has 2 divisors, whose sum is σ = 20110012211198. Its totient is φ = 20110012211196.
The previous prime is 20110012211119. The next prime is 20110012211273. The reversal of 20110012211197 is 79111221001102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15306787687321 + 4803224523876 = 3912389^2 + 2191626^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110012211197 - 211 = 20110012209149 is a prime.
It is a super-2 number, since 2×201100122111972 (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 (20110012211297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055006105598 + 10055006105599.
It is an arithmetic number, because the mean of its divisors is an integer number (10055006105599).
Almost surely, 220110012211197 is an apocalyptic number.
It is an amenable number.
20110012211197 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110012211197 is an equidigital number, since it uses as much as digits as its factorization.
20110012211197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 28.
Adding to 20110012211197 its reverse (79111221001102), we get a palindrome (99221233212299).
The spelling of 20110012211197 in words is "twenty trillion, one hundred ten billion, twelve million, two hundred eleven thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •