Search a number
-
+
10601515117 is a prime number
BaseRepresentation
bin10011101111110011…
…00100100001101101
31000100211121202202001
421313321210201231
5133202441440432
64511551132301
7523500251224
oct116771444155
930324552661
1010601515117
114550308246
12207a514091
13ccc4c688b
14727dc1cbb
15420ac99e7
hex277e6486d

10601515117 has 2 divisors, whose sum is σ = 10601515118. Its totient is φ = 10601515116.

The previous prime is 10601515081. The next prime is 10601515121. The reversal of 10601515117 is 71151510601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7214973481 + 3386541636 = 84941^2 + 58194^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10601515117 - 227 = 10467297389 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10601515147) 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, 5300757558 + 5300757559.

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

Almost surely, 210601515117 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10601515117 in words is "ten billion, six hundred one million, five hundred fifteen thousand, one hundred seventeen".