Search a number
-
+
36566635901 is a prime number
BaseRepresentation
bin100010000011100010…
…101001010101111101
310111101101120120101012
4202003202221111331
51044342024322101
624444245525005
72433104163635
oct420342512575
9114341516335
1036566635901
1114564a04854
127106113765
1335a9977483
141aac5d76c5
15e4038dbbb
hex8838a957d

36566635901 has 2 divisors, whose sum is σ = 36566635902. Its totient is φ = 36566635900.

The previous prime is 36566635871. The next prime is 36566635907. The reversal of 36566635901 is 10953666563.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 27055315225 + 9511320676 = 164485^2 + 97526^2 .

It is a cyclic number.

It is not a de Polignac number, because 36566635901 - 26 = 36566635837 is a prime.

It is a super-2 number, since 2×365666359012 (a number of 22 digits) contains 22 as substring.

It is a Sophie Germain 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 36566635901.

It is a congruent number.

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

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

Almost surely, 236566635901 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2624400, while the sum is 50.

The spelling of 36566635901 in words is "thirty-six billion, five hundred sixty-six million, six hundred thirty-five thousand, nine hundred one".