Base | Representation |
---|---|
bin | 1001010010001100000011… |
… | …1110111011000101100101 |
3 | 1100010212211122111021011011 |
4 | 2110203000332323011211 |
5 | 2314222121441000332 |
6 | 33413305513542221 |
7 | 2102336511321403 |
oct | 224430076730545 |
9 | 40125748437134 |
10 | 10208080015717 |
11 | 328624a054661 |
12 | 118a489414971 |
13 | 59080545508c |
14 | 274106386473 |
15 | 12a80791ae47 |
hex | 948c0fbb165 |
10208080015717 has 2 divisors, whose sum is σ = 10208080015718. Its totient is φ = 10208080015716.
The previous prime is 10208080015691. The next prime is 10208080015729. The reversal of 10208080015717 is 71751008080201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8163597554401 + 2044482461316 = 2857201^2 + 1429854^2 .
It is a cyclic number.
It is not a de Polignac number, because 10208080015717 - 219 = 10208079491429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10208080015717.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10208080015517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5104040007858 + 5104040007859.
It is an arithmetic number, because the mean of its divisors is an integer number (5104040007859).
Almost surely, 210208080015717 is an apocalyptic number.
It is an amenable number.
10208080015717 is a deficient number, since it is larger than the sum of its proper divisors (1).
10208080015717 is an equidigital number, since it uses as much as digits as its factorization.
10208080015717 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31360, while the sum is 40.
Adding to 10208080015717 its reverse (71751008080201), we get a palindrome (81959088095918).
The spelling of 10208080015717 in words is "ten trillion, two hundred eight billion, eighty million, fifteen thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •