Base | Representation |
---|---|
bin | 1001000110000110111110… |
… | …00011101101100000100101 |
3 | 2121211002100202011110211101 |
4 | 10203003133003231200211 |
5 | 10110144233131202211 |
6 | 110312214425440101 |
7 | 4133014103036101 |
oct | 443033703554045 |
9 | 77732322143741 |
10 | 20001110022181 |
11 | 64114721a8142 |
12 | 22b0423340031 |
13 | b211342633b2 |
14 | 4d20b7848901 |
15 | 24a41c54b5c1 |
hex | 1230df0ed825 |
20001110022181 has 2 divisors, whose sum is σ = 20001110022182. Its totient is φ = 20001110022180.
The previous prime is 20001110022151. The next prime is 20001110022233. The reversal of 20001110022181 is 18122001110002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19095510365281 + 905599656900 = 4369841^2 + 951630^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001110022181 - 27 = 20001110022053 is a prime.
It is a super-2 number, since 2×200011100221812 (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 (20001110022121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000555011090 + 10000555011091.
It is an arithmetic number, because the mean of its divisors is an integer number (10000555011091).
Almost surely, 220001110022181 is an apocalyptic number.
It is an amenable number.
20001110022181 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001110022181 is an equidigital number, since it uses as much as digits as its factorization.
20001110022181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 20001110022181 its reverse (18122001110002), we get a palindrome (38123111132183).
The spelling of 20001110022181 in words is "twenty trillion, one billion, one hundred ten million, twenty-two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.717 sec. • engine limits •