Search a number
-
+
16120621513 is a prime number
BaseRepresentation
bin11110000001101110…
…10010100111001001
31112121110210102102001
433000313102213021
5231003334342023
611223344511001
71110325010353
oct170067224711
945543712361
1016120621513
1169227415a7
12315a91b461
13169ba69cc9
14accdb00d3
156453c06ad
hex3c0dd29c9

16120621513 has 2 divisors, whose sum is σ = 16120621514. Its totient is φ = 16120621512.

The previous prime is 16120621511. The next prime is 16120621523. The reversal of 16120621513 is 31512602161.

16120621513 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., 16115794704 + 4826809 = 126948^2 + 2197^2 .

It is a cyclic number.

It is not a de Polignac number, because 16120621513 - 21 = 16120621511 is a prime.

It is a super-3 number, since 3×161206215133 (a number of 32 digits) contains 333 as substring.

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

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

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

Almost surely, 216120621513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 16120621513 in words is "sixteen billion, one hundred twenty million, six hundred twenty-one thousand, five hundred thirteen".