Search a number
-
+
36376011010013 is a prime number
BaseRepresentation
bin10000100010101011100110…
…01101101110111111011101
311202210111211202021201120112
420101111303031232333131
514231441032304310023
6205210524143055405
710443036314635163
oct1021256315567735
9152714752251515
1036376011010013
1110654a85992644
1240b5ab85a1565
13173b32119753c
148da87336b233
154313545e1478
hex21157336efdd

36376011010013 has 2 divisors, whose sum is σ = 36376011010014. Its totient is φ = 36376011010012.

The previous prime is 36376011009979. The next prime is 36376011010057. The reversal of 36376011010013 is 31001011067363.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 34499623355044 + 1876387654969 = 5873638^2 + 1369813^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 36376011010013 - 214 = 36376010993629 is a prime.

It is a congruent number.

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

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

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

Almost surely, 236376011010013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6804, while the sum is 32.

Adding to 36376011010013 its reverse (31001011067363), we get a palindrome (67377022077376).

The spelling of 36376011010013 in words is "thirty-six trillion, three hundred seventy-six billion, eleven million, ten thousand, thirteen".