Search a number
-
+
16105602013 is a prime number
BaseRepresentation
bin11101111111111011…
…11111101111011101
31112120102112100112021
432333331333233131
5230441013231023
611222050540141
71110053233624
oct167775775735
945512470467
1016105602013
116915213196
123155897651
13169890b827
14acadc06bb
15643e0535d
hex3bff7fbdd

16105602013 has 2 divisors, whose sum is σ = 16105602014. Its totient is φ = 16105602012.

The previous prime is 16105602011. The next prime is 16105602047. The reversal of 16105602013 is 31020650161.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 15929721369 + 175880644 = 126213^2 + 13262^2 .

It is an emirp because it is prime and its reverse (31020650161) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 16105602013 - 21 = 16105602011 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 216105602013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 25.

The spelling of 16105602013 in words is "sixteen billion, one hundred five million, six hundred two thousand, thirteen".