Base | Representation |
---|---|
bin | 1001101101000101… |
… | …11111100001000101 |
3 | 111110002202000022211 |
4 | 10312202333201011 |
5 | 41132242010041 |
6 | 2220554423421 |
7 | 243053130064 |
oct | 46642774105 |
9 | 14402660284 |
10 | 5210110021 |
11 | 2233a75856 |
12 | 1014a31b71 |
13 | 65054584c |
14 | 375d561db |
15 | 20760b481 |
hex | 1368bf845 |
5210110021 has 2 divisors, whose sum is σ = 5210110022. Its totient is φ = 5210110020.
The previous prime is 5210109997. The next prime is 5210110049. The reversal of 5210110021 is 1200110125.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4474941025 + 735168996 = 66895^2 + 27114^2 .
It is a cyclic number.
It is not a de Polignac number, because 5210110021 - 231 = 3062626373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5210109983 and 5210110010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5210180021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2605055010 + 2605055011.
It is an arithmetic number, because the mean of its divisors is an integer number (2605055011).
Almost surely, 25210110021 is an apocalyptic number.
It is an amenable number.
5210110021 is a deficient number, since it is larger than the sum of its proper divisors (1).
5210110021 is an equidigital number, since it uses as much as digits as its factorization.
5210110021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 5210110021 is about 72181.0918523681. The cubic root of 5210110021 is about 1733.6002652967.
Adding to 5210110021 its reverse (1200110125), we get a palindrome (6410220146).
The spelling of 5210110021 in words is "five billion, two hundred ten million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •