Search a number
-
+
12500355961 is a prime number
BaseRepresentation
bin10111010010001010…
…00100101101111001
31012021011121212200201
423221011010231321
5201100042342321
65424222002201
7621525162322
oct135105045571
935234555621
1012500355961
1153351414a5
12250a416361
131242a12942
14868267449
154d2659291
hex2e9144b79

12500355961 has 2 divisors, whose sum is σ = 12500355962. Its totient is φ = 12500355960.

The previous prime is 12500355913. The next prime is 12500356007. The reversal of 12500355961 is 16955300521.

12500355961 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., 11673505936 + 826850025 = 108044^2 + 28755^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 212500355961 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 12500355961 in words is "twelve billion, five hundred million, three hundred fifty-five thousand, nine hundred sixty-one".