Search a number
-
+
10150159507 is a prime number
BaseRepresentation
bin10010111001111111…
…10010010010010011
3222012101022112020121
421130333302102103
5131241420101012
64355105051111
7506346634525
oct113477622223
928171275217
1010150159507
114339556084
121b73326a97
13c59b43b57
146c408da15
153e616ea07
hex25cff2493

10150159507 has 2 divisors, whose sum is σ = 10150159508. Its totient is φ = 10150159506.

The previous prime is 10150159501. The next prime is 10150159511. The reversal of 10150159507 is 70595105101.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10150159507 - 227 = 10015941779 is a prime.

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

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

Almost surely, 210150159507 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7875, while the sum is 34.

The spelling of 10150159507 in words is "ten billion, one hundred fifty million, one hundred fifty-nine thousand, five hundred seven".