Search a number
-
+
16705361513 is a prime number
BaseRepresentation
bin11111000111011011…
…11001011001101001
31121010020002021220002
433203231321121221
5233203033032023
611401353512345
71130655141611
oct174355713151
947106067802
1016705361513
1170a28173a5
1232a27126b5
131762c51ac9
14b46903a41
1567b8c6b28
hex3e3b79669

16705361513 has 2 divisors, whose sum is σ = 16705361514. Its totient is φ = 16705361512.

The previous prime is 16705361479. The next prime is 16705361531. The reversal of 16705361513 is 31516350761.

It is a happy number.

Together with next prime (16705361531) 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., 13861059289 + 2844302224 = 117733^2 + 53332^2 .

It is a cyclic number.

It is not a de Polignac number, because 16705361513 - 210 = 16705360489 is a prime.

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

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

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

Almost surely, 216705361513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 16705361513 in words is "sixteen billion, seven hundred five million, three hundred sixty-one thousand, five hundred thirteen".