Search a number
-
+
10151530541 is a prime number
BaseRepresentation
bin10010111010001010…
…00001000000101101
3222012110220011221122
421131011001000231
5131242242434131
64355154310325
7506364404645
oct113505010055
928173804848
1010151530541
11433a302169
121b738883a5
13c5a203c09
146c4329525
153e6340d7b
hex25d14102d

10151530541 has 2 divisors, whose sum is σ = 10151530542. Its totient is φ = 10151530540.

The previous prime is 10151530523. The next prime is 10151530553. The reversal of 10151530541 is 14503515101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6499745641 + 3651784900 = 80621^2 + 60430^2 .

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

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10151530541.

It is a congruent number.

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

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

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

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

Almost surely, 210151530541 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1500, while the sum is 26.

The spelling of 10151530541 in words is "ten billion, one hundred fifty-one million, five hundred thirty thousand, five hundred forty-one".