Search a number
-
+
36948065477 is a prime number
BaseRepresentation
bin100010011010010001…
…101011110011000101
310112100222022012101112
4202122101223303011
51101132201043402
624550153134405
72445415242341
oct423221536305
9115328265345
1036948065477
1114740246504
1271b19ba405
13363a9b624b
141b07126621
15e63ad4e52
hex89a46bcc5

36948065477 has 2 divisors, whose sum is σ = 36948065478. Its totient is φ = 36948065476.

The previous prime is 36948065447. The next prime is 36948065527. The reversal of 36948065477 is 77456084963.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 31911892321 + 5036173156 = 178639^2 + 70966^2 .

It is a cyclic number.

It is not a de Polignac number, because 36948065477 - 28 = 36948065221 is a prime.

It is a congruent number.

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

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

Almost surely, 236948065477 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30481920, while the sum is 59.

The spelling of 36948065477 in words is "thirty-six billion, nine hundred forty-eight million, sixty-five thousand, four hundred seventy-seven".