Base | Representation |
---|---|
bin | 1001000110011011101100… |
… | …00010111101110110111101 |
3 | 2121212011001221020110012012 |
4 | 10203031312002331312331 |
5 | 10110340023134334323 |
6 | 110321254252221005 |
7 | 4133556535601204 |
oct | 443156602756675 |
9 | 77764057213165 |
10 | 20012233121213 |
11 | 641615a974073 |
12 | 22b260846a765 |
13 | b221b782b3b8 |
14 | 4d2850c0023b |
15 | 24a86dd04678 |
hex | 1233760bddbd |
20012233121213 has 2 divisors, whose sum is σ = 20012233121214. Its totient is φ = 20012233121212.
The previous prime is 20012233121203. The next prime is 20012233121273. The reversal of 20012233121213 is 31212133221002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16077036505924 + 3935196615289 = 4009618^2 + 1983733^2 .
It is a cyclic number.
It is not a de Polignac number, because 20012233121213 - 212 = 20012233117117 is a prime.
It is a super-2 number, since 2×200122331212132 (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 (20012233121203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10006116560606 + 10006116560607.
It is an arithmetic number, because the mean of its divisors is an integer number (10006116560607).
Almost surely, 220012233121213 is an apocalyptic number.
It is an amenable number.
20012233121213 is a deficient number, since it is larger than the sum of its proper divisors (1).
20012233121213 is an equidigital number, since it uses as much as digits as its factorization.
20012233121213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 20012233121213 its reverse (31212133221002), we get a palindrome (51224366342215).
The spelling of 20012233121213 in words is "twenty trillion, twelve billion, two hundred thirty-three million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •