Search a number
-
+
103016513 is a prime number
BaseRepresentation
bin1100010001111…
…10100001000001
321011211210002102
412020332201001
5202333012023
614120000145
72360424455
oct610764101
9234753072
10103016513
1153171916
122a600055
131845b822
14d978665
15909d628
hex623e841

103016513 has 2 divisors, whose sum is σ = 103016514. Its totient is φ = 103016512.

The previous prime is 103016491. The next prime is 103016531. The reversal of 103016513 is 315610301.

It is a happy number.

Together with next prime (103016531) 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., 99660289 + 3356224 = 9983^2 + 1832^2 .

It is a cyclic number.

It is not a de Polignac number, because 103016513 - 216 = 102950977 is a prime.

It is a super-2 number, since 2×1030165132 = 21224803901358338, which contains 22 as substring.

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

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

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

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

Almost surely, 2103016513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 270, while the sum is 20.

The square root of 103016513 is about 10149.7050696067. The cubic root of 103016513 is about 468.7798637448.

Adding to 103016513 its reverse (315610301), we get a palindrome (418626814).

The spelling of 103016513 in words is "one hundred three million, sixteen thousand, five hundred thirteen".