Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …100011010110011010101 |
3 | 21010011012001210202122102 |
4 | 131033331330122303111 |
5 | 230413000102420201 |
6 | 4135215210211445 |
7 | 265134632545304 |
oct | 35177574326325 |
9 | 7104161722572 |
10 | 2010010201301 |
11 | 7054933a3223 |
12 | 285678423b85 |
13 | 11770a3b3bcb |
14 | 6d3dc10a43b |
15 | 37441c0326b |
hex | 1d3fdf1acd5 |
2010010201301 has 2 divisors, whose sum is σ = 2010010201302. Its totient is φ = 2010010201300.
The previous prime is 2010010201289. The next prime is 2010010201307. The reversal of 2010010201301 is 1031020100102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1984156777201 + 25853424100 = 1408601^2 + 160790^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010010201301 - 26 = 2010010201237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010010201307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005005100650 + 1005005100651.
It is an arithmetic number, because the mean of its divisors is an integer number (1005005100651).
Almost surely, 22010010201301 is an apocalyptic number.
It is an amenable number.
2010010201301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010010201301 is an equidigital number, since it uses as much as digits as its factorization.
2010010201301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 2010010201301 its reverse (1031020100102), we get a palindrome (3041030301403).
The spelling of 2010010201301 in words is "two trillion, ten billion, ten million, two hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •