Search a number
-
+
106502170513 is a prime number
BaseRepresentation
bin110001100110000000…
…1100010011110010001
3101011220022121211100211
41203030001202132101
53221104023424023
6120532035044121
710460136340564
oct1431401423621
9334808554324
10106502170513
1141192776042
1218783440641
13a07394050b
14522482c4db
152b84eb8a0d
hex18cc062791

106502170513 has 2 divisors, whose sum is σ = 106502170514. Its totient is φ = 106502170512.

The previous prime is 106502170493. The next prime is 106502170529. The reversal of 106502170513 is 315071205601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 103177148944 + 3325021569 = 321212^2 + 57663^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 106502170513 - 213 = 106502162321 is a prime.

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

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

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

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

Almost surely, 2106502170513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6300, while the sum is 31.

The spelling of 106502170513 in words is "one hundred six billion, five hundred two million, one hundred seventy thousand, five hundred thirteen".