Search a number
-
+
5046050379397 is a prime number
BaseRepresentation
bin100100101101110000000…
…0010100101011010000101
3122212101201221000210010111
41021123200002211122011
51130133302344120042
614422042403553021
71030364555346046
oct111334002453205
918771657023114
105046050379397
111676021986155
12695b6008b771
132a7ac07a1581
141363317188cd
158b3d5493517
hex496e00a5685

5046050379397 has 2 divisors, whose sum is σ = 5046050379398. Its totient is φ = 5046050379396.

The previous prime is 5046050379379. The next prime is 5046050379413. The reversal of 5046050379397 is 7939730506405.

Together with previous prime (5046050379379) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4159291040356 + 886759339041 = 2039434^2 + 941679^2 .

It is a cyclic number.

It is not a de Polignac number, because 5046050379397 - 211 = 5046050377349 is a prime.

It is a congruent number.

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

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

Almost surely, 25046050379397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21432600, while the sum is 58.

The spelling of 5046050379397 in words is "five trillion, forty-six billion, fifty million, three hundred seventy-nine thousand, three hundred ninety-seven".