Base | Representation |
---|---|
bin | 1001010010011010101100… |
… | …1111110110010001110101 |
3 | 1100011020222120001110102222 |
4 | 2110212223033312101311 |
5 | 2314303144120233023 |
6 | 33415155514012125 |
7 | 2102536064342414 |
oct | 224465317662165 |
9 | 40136876043388 |
10 | 10212010321013 |
11 | 3287986666156 |
12 | 118b1a5717045 |
13 | 590cb07b3c07 |
14 | 27439a35747b |
15 | 12a9879c5cc8 |
hex | 949ab3f6475 |
10212010321013 has 2 divisors, whose sum is σ = 10212010321014. Its totient is φ = 10212010321012.
The previous prime is 10212010321001. The next prime is 10212010321033. The reversal of 10212010321013 is 31012301021201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10035831171844 + 176179149169 = 3167938^2 + 419737^2 .
It is a cyclic number.
It is not a de Polignac number, because 10212010321013 - 216 = 10212010255477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10212010320982 and 10212010321000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10212010321033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106005160506 + 5106005160507.
It is an arithmetic number, because the mean of its divisors is an integer number (5106005160507).
Almost surely, 210212010321013 is an apocalyptic number.
It is an amenable number.
10212010321013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212010321013 is an equidigital number, since it uses as much as digits as its factorization.
10212010321013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10212010321013 its reverse (31012301021201), we get a palindrome (41224311342214).
The spelling of 10212010321013 in words is "ten trillion, two hundred twelve billion, ten million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •