Search a number
-
+
16553153713 is a prime number
BaseRepresentation
bin11110110101010010…
…10001010010110001
31120201121200100001011
433122221101102301
5232400101404323
611334315310521
71124126325235
oct173251212261
946647610034
1016553153713
117024907428
12325b74b441
13173a55c015
14b306025c5
1566d35d20d
hex3daa514b1

16553153713 has 2 divisors, whose sum is σ = 16553153714. Its totient is φ = 16553153712.

The previous prime is 16553153663. The next prime is 16553153719. The reversal of 16553153713 is 31735135561.

It is a happy number.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 15900453409 + 652700304 = 126097^2 + 25548^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 16553153713 - 217 = 16553022641 is a prime.

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

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

Almost surely, 216553153713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 141750, while the sum is 40.

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