Search a number
-
+
36945113 is a prime number
BaseRepresentation
bin1000110011101…
…1110011011001
32120112000011112
42030323303121
533424220423
63355510105
7626012462
oct214736331
976460145
1036945113
1119944457
1210458335
13786721a
144c99d69
15339ba78
hex233bcd9

36945113 has 2 divisors, whose sum is σ = 36945114. Its totient is φ = 36945112.

The previous prime is 36945089. The next prime is 36945119. The reversal of 36945113 is 31154963.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 35485849 + 1459264 = 5957^2 + 1208^2 .

It is a cyclic number.

It is not a de Polignac number, because 36945113 - 28 = 36944857 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

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

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

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

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

Almost surely, 236945113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 9720, while the sum is 32.

The square root of 36945113 is about 6078.2491722535. The cubic root of 36945113 is about 333.0573327563.

The spelling of 36945113 in words is "thirty-six million, nine hundred forty-five thousand, one hundred thirteen".