Search a number
-
+
36950051 is a prime number
BaseRepresentation
bin1000110011110…
…1000000100011
32120112020221102
42030331000203
533424400201
63355545015
7626033045
oct214750043
976466842
1036950051
1119948136
121045b16b
137869548
144c9ba95
15339d26b
hex233d023

36950051 has 2 divisors, whose sum is σ = 36950052. Its totient is φ = 36950050.

The previous prime is 36949999. The next prime is 36950057. The reversal of 36950051 is 15005963.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 36950051 - 214 = 36933667 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is equal to p2258732 and since 36950051 and 2258732 have the same sum of digits, it is a Honaker prime.

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

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

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

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

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

Almost surely, 236950051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4050, while the sum is 29.

The square root of 36950051 is about 6078.6553611798. The cubic root of 36950051 is about 333.0721706578.

The spelling of 36950051 in words is "thirty-six million, nine hundred fifty thousand, fifty-one".