Search a number
-
+
10117471153 is a prime number
BaseRepresentation
bin10010110110000110…
…00101101110110001
3222010002210210020211
421123003011232301
5131210033034103
64351540304121
7505502041306
oct113303055661
928102723224
1010117471153
114322059909
121b643a2041
13c5313a32a
146bd9c10ad
153e336436d
hex25b0c5bb1

10117471153 has 2 divisors, whose sum is σ = 10117471154. Its totient is φ = 10117471152.

The previous prime is 10117471073. The next prime is 10117471201. The reversal of 10117471153 is 35117471101.

10117471153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9988603249 + 128867904 = 99943^2 + 11352^2 .

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

It is a cyclic number.

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

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

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

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

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

Almost surely, 210117471153 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10117471153 in words is "ten billion, one hundred seventeen million, four hundred seventy-one thousand, one hundred fifty-three".