Search a number
-
+
16745575355357 is a prime number
BaseRepresentation
bin1111001110101110001000…
…0100100001001111011101
32012021212020221100010200212
43303223202010201033131
54143324414242332412
655340451111302205
73345553652664242
oct363534204411735
965255227303625
1016745575355357
115376838806102
121a654a337a965
13946140b13734
1441c6c10615c9
151e08ce172222
hexf3ae21213dd

16745575355357 has 2 divisors, whose sum is σ = 16745575355358. Its totient is φ = 16745575355356.

The previous prime is 16745575355339. The next prime is 16745575355359. The reversal of 16745575355357 is 75355357554761.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10666618828441 + 6078956526916 = 3265979^2 + 2465554^2 .

It is a cyclic number.

It is not a de Polignac number, because 16745575355357 - 232 = 16741280388061 is a prime.

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

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (16745575355359) 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, 8372787677678 + 8372787677679.

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

Almost surely, 216745575355357 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1157625000, while the sum is 68.

The spelling of 16745575355357 in words is "sixteen trillion, seven hundred forty-five billion, five hundred seventy-five million, three hundred fifty-five thousand, three hundred fifty-seven".