Search a number
-
+
170732091401 is a prime number
BaseRepresentation
bin1001111100000001101…
…1001111100000001001
3121022200121112212201122
42133000123033200021
510244124403411101
6210233325125025
715222620555264
oct2370033174011
9538617485648
10170732091401
11664528a6293
12291099b9775
131313b821371
148398da5cdb
154693c5b51b
hex27c06cf809

170732091401 has 2 divisors, whose sum is σ = 170732091402. Its totient is φ = 170732091400.

The previous prime is 170732091373. The next prime is 170732091403. The reversal of 170732091401 is 104190237071.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 122640040000 + 48092051401 = 350200^2 + 219299^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-170732091401 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2170732091401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10584, while the sum is 35.

The spelling of 170732091401 in words is "one hundred seventy billion, seven hundred thirty-two million, ninety-one thousand, four hundred one".