Search a number
-
+
10130152159 is a prime number
BaseRepresentation
bin10010110111100110…
…11101101011011111
3222010222200001022201
421123303131223133
5131221304332114
64353112152331
7506014605211
oct113363355337
928128601281
1010130152159
114329230286
121b686986a7
13c5595a29a
146c15625b1
153e451b874
hex25bcddadf

10130152159 has 2 divisors, whose sum is σ = 10130152160. Its totient is φ = 10130152158.

The previous prime is 10130152091. The next prime is 10130152171. The reversal of 10130152159 is 95125103101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10130152159 - 213 = 10130143967 is a prime.

It is a super-2 number, since 2×101301521592 (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 (10134152159) by changing a digit.

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

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

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

Almost surely, 210130152159 is an apocalyptic number.

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

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

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

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

The spelling of 10130152159 in words is "ten billion, one hundred thirty million, one hundred fifty-two thousand, one hundred fifty-nine".