Base | Representation |
---|---|
bin | 1001000111000010000001… |
… | …1110001110011111011001 |
3 | 1022110120002201202212212101 |
4 | 2101300200132032133121 |
5 | 2303102101040410412 |
6 | 33145250300443401 |
7 | 2052442640500663 |
oct | 221604036163731 |
9 | 38416081685771 |
10 | 10016408528857 |
11 | 3211a3153a675 |
12 | 11592b6b49561 |
13 | 57870a74b0b3 |
14 | 268b22445533 |
15 | 12583a734457 |
hex | 91c2078e7d9 |
10016408528857 has 2 divisors, whose sum is σ = 10016408528858. Its totient is φ = 10016408528856.
The previous prime is 10016408528831. The next prime is 10016408528911. The reversal of 10016408528857 is 75882580461001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5671585117081 + 4344823411776 = 2381509^2 + 2084424^2 .
It is a cyclic number.
It is not a de Polignac number, because 10016408528857 - 27 = 10016408528729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10016408528798 and 10016408528807.
It is not a weakly prime, because it can be changed into another prime (10016408526857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5008204264428 + 5008204264429.
It is an arithmetic number, because the mean of its divisors is an integer number (5008204264429).
Almost surely, 210016408528857 is an apocalyptic number.
It is an amenable number.
10016408528857 is a deficient number, since it is larger than the sum of its proper divisors (1).
10016408528857 is an equidigital number, since it uses as much as digits as its factorization.
10016408528857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4300800, while the sum is 55.
Adding to 10016408528857 its reverse (75882580461001), we get a palindrome (85898988989858).
The spelling of 10016408528857 in words is "ten trillion, sixteen billion, four hundred eight million, five hundred twenty-eight thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •