Search a number
-
+
10150575229 is a prime number
BaseRepresentation
bin10010111010000010…
…10111110001111101
3222012102002122111201
421131001113301331
5131242021401404
64355122015501
7506353315534
oct113501276175
928172078451
1010150575229
11433980a453
121b734a7591
13c59c5b142
146c415b31b
153e6202ca4
hex25d057c7d

10150575229 has 2 divisors, whose sum is σ = 10150575230. Its totient is φ = 10150575228.

The previous prime is 10150575199. The next prime is 10150575233. The reversal of 10150575229 is 92257505101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8916458329 + 1234116900 = 94427^2 + 35130^2 .

It is a cyclic number.

It is not a de Polignac number, because 10150575229 - 233 = 1560640637 is a prime.

It is a congruent number.

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

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

Almost surely, 210150575229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31500, while the sum is 37.

The spelling of 10150575229 in words is "ten billion, one hundred fifty million, five hundred seventy-five thousand, two hundred twenty-nine".