Search a number
-
+
16005560113 is a prime number
BaseRepresentation
bin11101110100000000…
…10111011100110001
31112022110021200211201
432322000113130301
5230234410410423
611204114411201
71104430005364
oct167200273461
945273250751
1016005560113
1168737a3234
123128290b01
131680c81c3a
14abb9bc0db
1563a2432ad
hex3ba017731

16005560113 has 2 divisors, whose sum is σ = 16005560114. Its totient is φ = 16005560112.

The previous prime is 16005560107. The next prime is 16005560149. The reversal of 16005560113 is 31106550061.

16005560113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 15730928929 + 274631184 = 125423^2 + 16572^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 16005560113 - 213 = 16005551921 is a prime.

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

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

Almost surely, 216005560113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 28.

The spelling of 16005560113 in words is "sixteen billion, five million, five hundred sixty thousand, one hundred thirteen".