Base | Representation |
---|---|
bin | 1001000110000101010010… |
… | …11110001101111101011101 |
3 | 2121211000001002111110212022 |
4 | 10203002221132031331131 |
5 | 10110140413004014211 |
6 | 110311545312345525 |
7 | 4132652605345445 |
oct | 443025136157535 |
9 | 77730032443768 |
10 | 20000211001181 |
11 | 6411050784384 |
12 | 22b02122452a5 |
13 | b2101cc204c8 |
14 | 4d20302a5125 |
15 | 24a3b8664bdb |
hex | 1230a978df5d |
20000211001181 has 2 divisors, whose sum is σ = 20000211001182. Its totient is φ = 20000211001180.
The previous prime is 20000211001153. The next prime is 20000211001237. The reversal of 20000211001181 is 18110011200002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16773193969081 + 3227017032100 = 4095509^2 + 1796390^2 .
It is a cyclic number.
It is not a de Polignac number, because 20000211001181 - 210 = 20000211000157 is a prime.
It is a super-3 number, since 3×200002110011813 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20000211001081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000105500590 + 10000105500591.
It is an arithmetic number, because the mean of its divisors is an integer number (10000105500591).
Almost surely, 220000211001181 is an apocalyptic number.
It is an amenable number.
20000211001181 is a deficient number, since it is larger than the sum of its proper divisors (1).
20000211001181 is an equidigital number, since it uses as much as digits as its factorization.
20000211001181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 20000211001181 its reverse (18110011200002), we get a palindrome (38110222201183).
The spelling of 20000211001181 in words is "twenty trillion, two hundred eleven million, one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •