Search a number
-
+
105202016597 is a prime number
BaseRepresentation
bin110000111111010000…
…1110110000101010101
3101001112201011011111002
41201332201312011111
53210423204012342
6120155032153045
710413001246436
oct1417641660525
9331481134432
10105202016597
1140685883177
121847bb38785
139bc7480482
14513dcab48d
152b0ac97d32
hex187e876155

105202016597 has 2 divisors, whose sum is σ = 105202016598. Its totient is φ = 105202016596.

The previous prime is 105202016567. The next prime is 105202016641. The reversal of 105202016597 is 795610202501.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 105189300241 + 12716356 = 324329^2 + 3566^2 .

It is a cyclic number.

It is not a de Polignac number, because 105202016597 - 28 = 105202016341 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 105202016597.

It is a congruent number.

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

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

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

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

Almost surely, 2105202016597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 37800, while the sum is 38.

The spelling of 105202016597 in words is "one hundred five billion, two hundred two million, sixteen thousand, five hundred ninety-seven".