Search a number
-
+
16807311641 is a prime number
BaseRepresentation
bin11111010011100101…
…10011100100011001
31121101022220220011202
433221302303210121
5233410132433031
611415435003545
71133333535401
oct175162634431
947338826152
1016807311641
11714531aaaa
1233108995b5
13177b0c9123
14b56281801
156858142cb
hex3e9cb3919

16807311641 has 2 divisors, whose sum is σ = 16807311642. Its totient is φ = 16807311640.

The previous prime is 16807311551. The next prime is 16807311643. The reversal of 16807311641 is 14611370861.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8675059600 + 8132252041 = 93140^2 + 90179^2 .

It is a cyclic number.

It is not a de Polignac number, because 16807311641 - 210 = 16807310617 is a prime.

It is a super-2 number, since 2×168073116412 (a number of 21 digits) contains 22 as substring.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 16807311595 and 16807311604.

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

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

Almost surely, 216807311641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24192, while the sum is 38.

The spelling of 16807311641 in words is "sixteen billion, eight hundred seven million, three hundred eleven thousand, six hundred forty-one".