Search a number
-
+
5036346275497 is a prime number
BaseRepresentation
bin100100101001001110110…
…1000010111011010101001
3122211110200122001020010221
41021102131220113122221
51130003414121303442
614413355431210041
71026602233001665
oct111223550273251
918743618036127
105036346275497
1116719a21a2279
126940b2216921
132a6c051a5c64
14135a909bb8a5
158b018583467
hex4949da176a9

5036346275497 has 2 divisors, whose sum is σ = 5036346275498. Its totient is φ = 5036346275496.

The previous prime is 5036346275489. The next prime is 5036346275551. The reversal of 5036346275497 is 7945726436305.

5036346275497 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3391273254681 + 1645073020816 = 1841541^2 + 1282604^2 .

It is a cyclic number.

It is not a de Polignac number, because 5036346275497 - 23 = 5036346275489 is a prime.

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

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

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

Almost surely, 25036346275497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 114307200, while the sum is 61.

The spelling of 5036346275497 in words is "five trillion, thirty-six billion, three hundred forty-six million, two hundred seventy-five thousand, four hundred ninety-seven".