Search a number
-
+
15650566051 is a prime number
BaseRepresentation
bin11101001001101100…
…01010111110100011
31111101201022010112111
432210312022332203
5224023021103201
611104553540151
71062556421311
oct164466127643
944351263474
1015650566051
116701377a0a
123049414657
13162556a893
14a867b10b1
15618ebeb51
hex3a4d8afa3

15650566051 has 2 divisors, whose sum is σ = 15650566052. Its totient is φ = 15650566050.

The previous prime is 15650566037. The next prime is 15650566123. The reversal of 15650566051 is 15066505651.

It is a weak prime.

It is a cyclic number.

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

It is a super-4 number, since 4×156505660514 (a number of 42 digits) contains 4444 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 15650565995 and 15650566013.

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

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

Almost surely, 215650566051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 135000, while the sum is 40.

The spelling of 15650566051 in words is "fifteen billion, six hundred fifty million, five hundred sixty-six thousand, fifty-one".