Search a number
-
+
103422151513 is a prime number
BaseRepresentation
bin110000001010001110…
…0001100101101011001
3100212221200000122121001
41200110130030231121
53143302032322023
6115302251345001
710320616532422
oct1402434145531
9325850018531
10103422151513
113a95212119a
1218063a52161
1399a27c0075
145011756649
152a548ba6ad
hex181470cb59

103422151513 has 2 divisors, whose sum is σ = 103422151514. Its totient is φ = 103422151512.

The previous prime is 103422151493. The next prime is 103422151531. The reversal of 103422151513 is 315151224301.

Together with next prime (103422151531) 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., 95063072329 + 8359079184 = 308323^2 + 91428^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-103422151513 is a prime.

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

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

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

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

Almost surely, 2103422151513 is an apocalyptic number.

It is an amenable number.

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

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

103422151513 is an evil number, because the sum of its binary digits is even.

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

Adding to 103422151513 its reverse (315151224301), we get a palindrome (418573375814).

The spelling of 103422151513 in words is "one hundred three billion, four hundred twenty-two million, one hundred fifty-one thousand, five hundred thirteen".