Search a number
-
+
5246137250293 is a prime number
BaseRepresentation
bin100110001010111011000…
…1001011011000111110101
3200120112012022202222002111
41030111312021123013311
51141423042114002133
615054013040011021
71051010112604012
oct114256611330765
920515168688074
105246137250293
111742968790785
127088a0900a71
132c0929ab8334
14141cb3170709
15916e63771cd
hex4c57625b1f5

5246137250293 has 2 divisors, whose sum is σ = 5246137250294. Its totient is φ = 5246137250292.

The previous prime is 5246137250269. The next prime is 5246137250329. The reversal of 5246137250293 is 3920527316425.

It is a happy number.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5202970124004 + 43167126289 = 2281002^2 + 207767^2 .

It is a cyclic number.

It is not a de Polignac number, because 5246137250293 - 229 = 5245600379381 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 25246137250293 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 5246137250293 in words is "five trillion, two hundred forty-six billion, one hundred thirty-seven million, two hundred fifty thousand, two hundred ninety-three".