Base | Representation |
---|---|
bin | 1001000110000101010011… |
… | …00010011111010110010101 |
3 | 2121211000001011121100221101 |
4 | 10203002221202133112111 |
5 | 10110140413300332411 |
6 | 110311545352350101 |
7 | 4132652621021251 |
oct | 443025142372625 |
9 | 77730034540841 |
10 | 20000212120981 |
11 | 6411051379734 |
12 | 22b02126a5331 |
13 | b21020223101 |
14 | 4d20304b7261 |
15 | 24a3b87d68c1 |
hex | 1230a989f595 |
20000212120981 has 2 divisors, whose sum is σ = 20000212120982. Its totient is φ = 20000212120980.
The previous prime is 20000212120969. The next prime is 20000212121023. The reversal of 20000212120981 is 18902121200002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12264949558225 + 7735262562756 = 3502135^2 + 2781234^2 .
It is a cyclic number.
It is not a de Polignac number, because 20000212120981 - 223 = 20000203732373 is a prime.
It is a super-2 number, since 2×200002121209812 (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 (20000212120481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000106060490 + 10000106060491.
It is an arithmetic number, because the mean of its divisors is an integer number (10000106060491).
Almost surely, 220000212120981 is an apocalyptic number.
It is an amenable number.
20000212120981 is a deficient number, since it is larger than the sum of its proper divisors (1).
20000212120981 is an equidigital number, since it uses as much as digits as its factorization.
20000212120981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
Adding to 20000212120981 its reverse (18902121200002), we get a palindrome (38902333320983).
The spelling of 20000212120981 in words is "twenty trillion, two hundred twelve million, one hundred twenty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •