Search a number
-
+
10225005017 is a prime number
BaseRepresentation
bin10011000010111010…
…10011000111011001
3222101121011001222112
421201131103013121
5131420100130032
64410341202105
7511246052153
oct114135230731
928347131875
1010225005017
114377826677
121b94400335
13c6c4bb036
146cddb3ad3
153eca061b2
hex2617531d9

10225005017 has 2 divisors, whose sum is σ = 10225005018. Its totient is φ = 10225005016.

The previous prime is 10225004987. The next prime is 10225005023. The reversal of 10225005017 is 71050052201.

It is a happy number.

10225005017 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., 8209084816 + 2015920201 = 90604^2 + 44899^2 .

It is a cyclic number.

It is not a de Polignac number, because 10225005017 - 222 = 10220810713 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10225004983 and 10225005001.

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

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

Almost surely, 210225005017 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 10225005017 its reverse (71050052201), we get a palindrome (81275057218).

The spelling of 10225005017 in words is "ten billion, two hundred twenty-five million, five thousand, seventeen".