Base | Representation |
---|---|
bin | 1111100101001000110110… |
… | …0000101001000111010001 |
3 | 2020122200100012022012102222 |
4 | 3321102031200221013101 |
5 | 4221132140123032123 |
6 | 100233423040550425 |
7 | 3415436544041366 |
oct | 371221540510721 |
9 | 66580305265388 |
10 | 17130703720913 |
11 | 55050aa721422 |
12 | 1b08066022415 |
13 | 97355939b583 |
14 | 4331b809646d |
15 | 1ea9201606c8 |
hex | f948d8291d1 |
17130703720913 has 2 divisors, whose sum is σ = 17130703720914. Its totient is φ = 17130703720912.
The previous prime is 17130703720901. The next prime is 17130703720937. The reversal of 17130703720913 is 31902730703171.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9919180177729 + 7211523543184 = 3149473^2 + 2685428^2 .
It is an emirp because it is prime and its reverse (31902730703171) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-17130703720913 is a prime.
It is a super-2 number, since 2×171307037209132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (17130703720993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8565351860456 + 8565351860457.
It is an arithmetic number, because the mean of its divisors is an integer number (8565351860457).
Almost surely, 217130703720913 is an apocalyptic number.
It is an amenable number.
17130703720913 is a deficient number, since it is larger than the sum of its proper divisors (1).
17130703720913 is an equidigital number, since it uses as much as digits as its factorization.
17130703720913 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 166698, while the sum is 44.
The spelling of 17130703720913 in words is "seventeen trillion, one hundred thirty billion, seven hundred three million, seven hundred twenty thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •