Search a number
-
+
1708170580913 is a prime number
BaseRepresentation
bin11000110110110110111…
…001101001001110110001
320001022002100022100010212
4120312312321221032301
5210441313132042123
63344420035433505
7234261026241116
oct30666671511661
96038070270125
101708170580913
115a94818409a5
1223707aa55895
13c5106402434
145c96693a90d
152e677cb1878
hex18db6e693b1

1708170580913 has 2 divisors, whose sum is σ = 1708170580914. Its totient is φ = 1708170580912.

The previous prime is 1708170580859. The next prime is 1708170580931. The reversal of 1708170580913 is 3190850718071.

Together with next prime (1708170580931) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1484150118049 + 224020462864 = 1218257^2 + 473308^2 .

It is a cyclic number.

It is not a de Polignac number, because 1708170580913 - 220 = 1708169532337 is a prime.

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

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

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

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

Almost surely, 21708170580913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 423360, while the sum is 50.

The spelling of 1708170580913 in words is "one trillion, seven hundred eight billion, one hundred seventy million, five hundred eighty thousand, nine hundred thirteen".