Base | Representation |
---|---|
bin | 10010110101001101… |
… | …111110101101011101 |
3 | 1221012011220002121011 |
4 | 102311031332231131 |
5 | 312402333210023 |
6 | 13142233135221 |
7 | 1314034643413 |
oct | 226515765535 |
9 | 57164802534 |
10 | 20220210013 |
11 | 8636866073 |
12 | 3b0385a511 |
13 | 1ba31b9b13 |
14 | d9b6492b3 |
15 | 7d526850d |
hex | 4b537eb5d |
20220210013 has 2 divisors, whose sum is σ = 20220210014. Its totient is φ = 20220210012.
The previous prime is 20220210011. The next prime is 20220210053. The reversal of 20220210013 is 31001202202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12747990649 + 7472219364 = 112907^2 + 86442^2 .
It is a cyclic number.
It is not a de Polignac number, because 20220210013 - 21 = 20220210011 is a prime.
It is a super-3 number, since 3×202202100133 (a number of 32 digits) contains 333 as substring.
Together with 20220210011, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 20220209975 and 20220210002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20220210011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110105006 + 10110105007.
It is an arithmetic number, because the mean of its divisors is an integer number (10110105007).
Almost surely, 220220210013 is an apocalyptic number.
It is an amenable number.
20220210013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20220210013 is an equidigital number, since it uses as much as digits as its factorization.
20220210013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 20220210013 its reverse (31001202202), we get a palindrome (51221412215).
The spelling of 20220210013 in words is "twenty billion, two hundred twenty million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •