Search a number
-
+
15125291261 is a prime number
BaseRepresentation
bin11100001011000100…
…11010000011111101
31110001002220101222122
432011202122003331
5221434033310021
610540511252325
71043550566033
oct160542320375
943032811878
1015125291261
116461918213
122b2151a0a5
1315707a64b2
14a36b1a553
155d7d12bab
hex38589a0fd

15125291261 has 2 divisors, whose sum is σ = 15125291262. Its totient is φ = 15125291260.

The previous prime is 15125291231. The next prime is 15125291287. The reversal of 15125291261 is 16219252151.

15125291261 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., 12058236100 + 3067055161 = 109810^2 + 55381^2 .

It is a cyclic number.

It is not a de Polignac number, because 15125291261 - 210 = 15125290237 is a prime.

It is a congruent number.

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

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

Almost surely, 215125291261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 10800, while the sum is 35.

The spelling of 15125291261 in words is "fifteen billion, one hundred twenty-five million, two hundred ninety-one thousand, two hundred sixty-one".