Base | Representation |
---|---|
bin | 1100010010110100011… |
… | …0010000000110000101 |
3 | 202012011120220020200111 |
4 | 3010231012100012011 |
5 | 11430024230323023 |
6 | 241010055313021 |
7 | 21154660320601 |
oct | 3045506200605 |
9 | 665146806614 |
10 | 211210011013 |
11 | 816345aa411 |
12 | 34b2597b771 |
13 | 16bbc8c76a1 |
14 | a318c1c501 |
15 | 576269900d |
hex | 312d190185 |
211210011013 has 2 divisors, whose sum is σ = 211210011014. Its totient is φ = 211210011012.
The previous prime is 211210010989. The next prime is 211210011113. The reversal of 211210011013 is 310110012112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 157424052289 + 53785958724 = 396767^2 + 231918^2 .
It is a cyclic number.
It is not a de Polignac number, because 211210011013 - 225 = 211176456581 is a prime.
It is a super-2 number, since 2×2112100110132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211210010984 and 211210011002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211210011113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105605005506 + 105605005507.
It is an arithmetic number, because the mean of its divisors is an integer number (105605005507).
Almost surely, 2211210011013 is an apocalyptic number.
It is an amenable number.
211210011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
211210011013 is an equidigital number, since it uses as much as digits as its factorization.
211210011013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 211210011013 its reverse (310110012112), we get a palindrome (521320023125).
The spelling of 211210011013 in words is "two hundred eleven billion, two hundred ten million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •