Search a number
-
+
36905025397 is a prime number
BaseRepresentation
bin100010010111101101…
…011111111101110101
310112020222022112111111
4202113231133331311
51101040141303042
624542014435021
72444353353142
oct422755377565
9115228275444
1036905025397
1114718a19899
12719b502a71
133631ac6a46
141b015213c9
15e5ee32517
hex897b5ff75

36905025397 has 2 divisors, whose sum is σ = 36905025398. Its totient is φ = 36905025396.

The previous prime is 36905025347. The next prime is 36905025401. The reversal of 36905025397 is 79352050963.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31950132516 + 4954892881 = 178746^2 + 70391^2 .

It is an emirp because it is prime and its reverse (79352050963) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 36905025397 - 211 = 36905023349 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 236905025397 is an apocalyptic number.

It is an amenable number.

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

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

36905025397 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1530900, while the sum is 49.

The spelling of 36905025397 in words is "thirty-six billion, nine hundred five million, twenty-five thousand, three hundred ninety-seven".