Search a number
-
+
15650142713 is a prime number
BaseRepresentation
bin11101001001101001…
…00011100111111001
31111101200111121211022
432210310203213321
5224022414031323
611104540512225
71062553006142
oct164464434771
944350447738
1015650142713
116701108947
12304924b675
13162544cc9a
14a86700ac9
15618e394c8
hex3a4d239f9

15650142713 has 2 divisors, whose sum is σ = 15650142714. Its totient is φ = 15650142712.

The previous prime is 15650142707. The next prime is 15650142731. The reversal of 15650142713 is 31724105651.

It is a happy number.

Together with next prime (15650142731) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11250208489 + 4399934224 = 106067^2 + 66332^2 .

It is a cyclic number.

It is not a de Polignac number, because 15650142713 - 26 = 15650142649 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 215650142713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 35.

The spelling of 15650142713 in words is "fifteen billion, six hundred fifty million, one hundred forty-two thousand, seven hundred thirteen".