Search a number
-
+
102002711513 is a prime number
BaseRepresentation
bin101111011111111010…
…1011101101111011001
3100202021202002121222012
41132333311131233121
53132400143232023
6114505344035305
710240502512403
oct1367765355731
9322252077865
10102002711513
113a29396498a
1217928602b35
1398076c6041
144d19023b73
1529bee85978
hex17bfd5dbd9

102002711513 has 2 divisors, whose sum is σ = 102002711514. Its totient is φ = 102002711512.

The previous prime is 102002711429. The next prime is 102002711521. The reversal of 102002711513 is 315117200201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 82298413129 + 19704298384 = 286877^2 + 140372^2 .

It is a cyclic number.

It is not a de Polignac number, because 102002711513 - 216 = 102002645977 is a prime.

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

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

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

Almost surely, 2102002711513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 420, while the sum is 23.

Adding to 102002711513 its reverse (315117200201), we get a palindrome (417119911714).

The spelling of 102002711513 in words is "one hundred two billion, two million, seven hundred eleven thousand, five hundred thirteen".