Base | Representation |
---|---|
bin | 10000010010011011… |
… | …110000010101110001 |
3 | 1200010211220002221022 |
4 | 100102123300111301 |
5 | 241304204304321 |
6 | 12011232505225 |
7 | 1156253123444 |
oct | 202233602561 |
9 | 50124802838 |
10 | 17489134961 |
11 | 7465184a51 |
12 | 34810ab215 |
13 | 1859442c8c |
14 | bbca4765b |
15 | 6c55e5dab |
hex | 4126f0571 |
17489134961 has 2 divisors, whose sum is σ = 17489134962. Its totient is φ = 17489134960.
The previous prime is 17489134921. The next prime is 17489134963. The reversal of 17489134961 is 16943198471.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17349894961 + 139240000 = 131719^2 + 11800^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-17489134961 is a prime.
Together with 17489134963, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (17489134963) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8744567480 + 8744567481.
It is an arithmetic number, because the mean of its divisors is an integer number (8744567481).
Almost surely, 217489134961 is an apocalyptic number.
It is an amenable number.
17489134961 is a deficient number, since it is larger than the sum of its proper divisors (1).
17489134961 is an equidigital number, since it uses as much as digits as its factorization.
17489134961 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1306368, while the sum is 53.
The spelling of 17489134961 in words is "seventeen billion, four hundred eighty-nine million, one hundred thirty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •