Search a number
-
+
17056807213 is a prime number
BaseRepresentation
bin11111110001010101…
…00011100100101101
31122000201101120202111
433320222203210231
5234413020312323
611500310324021
71142453316625
oct177052434455
948021346674
1017056807213
117263139796
123380359611
1317ba9c3044
14b7b469885
1569c698c0d
hex3f8aa392d

17056807213 has 2 divisors, whose sum is σ = 17056807214. Its totient is φ = 17056807212.

The previous prime is 17056807211. The next prime is 17056807223. The reversal of 17056807213 is 31270865071.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8924014089 + 8132793124 = 94467^2 + 90182^2 .

It is an emirp because it is prime and its reverse (31270865071) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 17056807213 - 21 = 17056807211 is a prime.

Together with 17056807211, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (17056807211) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8528403606 + 8528403607.

It is an arithmetic number, because the mean of its divisors is an integer number (8528403607).

Almost surely, 217056807213 is an apocalyptic number.

It is an amenable number.

17056807213 is a deficient number, since it is larger than the sum of its proper divisors (1).

17056807213 is an equidigital number, since it uses as much as digits as its factorization.

17056807213 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 70560, while the sum is 40.

The spelling of 17056807213 in words is "seventeen billion, fifty-six million, eight hundred seven thousand, two hundred thirteen".