Base | Representation |
---|---|
bin | 1001010010010100100010… |
… | …1100011000011111101101 |
3 | 1100011002201022202202222011 |
4 | 2110211020230120133231 |
5 | 2314241302323404223 |
6 | 33414323450321221 |
7 | 2102450106206161 |
oct | 224451054303755 |
9 | 40132638682864 |
10 | 10210356856813 |
11 | 3287208298013 |
12 | 118aa03a29211 |
13 | 590aa907c029 |
14 | 274280906ca1 |
15 | 12a8dc76580d |
hex | 94948b187ed |
10210356856813 has 2 divisors, whose sum is σ = 10210356856814. Its totient is φ = 10210356856812.
The previous prime is 10210356856771. The next prime is 10210356856849. The reversal of 10210356856813 is 31865865301201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9719442230404 + 490914626409 = 3117602^2 + 700653^2 .
It is an emirp because it is prime and its reverse (31865865301201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10210356856813 - 217 = 10210356725741 is a prime.
It is a super-3 number, since 3×102103568568133 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210356856853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105178428406 + 5105178428407.
It is an arithmetic number, because the mean of its divisors is an integer number (5105178428407).
Almost surely, 210210356856813 is an apocalyptic number.
It is an amenable number.
10210356856813 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210356856813 is an equidigital number, since it uses as much as digits as its factorization.
10210356856813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 49.
The spelling of 10210356856813 in words is "ten trillion, two hundred ten billion, three hundred fifty-six million, eight hundred fifty-six thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •