Base | Representation |
---|---|
bin | 100100110000001101000… |
… | …1110000011100010101101 |
3 | 122212220100021110000021202 |
4 | 1021200122032003202231 |
5 | 1130230101241312422 |
6 | 14424313420535245 |
7 | 1030642311511043 |
oct | 111403216034255 |
9 | 18786307400252 |
10 | 5051321432237 |
11 | 1678287296173 |
12 | 696b913b1525 |
13 | 2a8450834252 |
14 | 1366b17b6393 |
15 | 8b5e30dbb92 |
hex | 4981a3838ad |
5051321432237 has 2 divisors, whose sum is σ = 5051321432238. Its totient is φ = 5051321432236.
The previous prime is 5051321432207. The next prime is 5051321432239. The reversal of 5051321432237 is 7322341231505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4903793231401 + 147528200836 = 2214451^2 + 384094^2 .
It is a cyclic number.
It is not a de Polignac number, because 5051321432237 - 210 = 5051321431213 is a prime.
Together with 5051321432239, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5051321432237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5051321432239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525660716118 + 2525660716119.
It is an arithmetic number, because the mean of its divisors is an integer number (2525660716119).
Almost surely, 25051321432237 is an apocalyptic number.
It is an amenable number.
5051321432237 is a deficient number, since it is larger than the sum of its proper divisors (1).
5051321432237 is an equidigital number, since it uses as much as digits as its factorization.
5051321432237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 151200, while the sum is 38.
The spelling of 5051321432237 in words is "five trillion, fifty-one billion, three hundred twenty-one million, four hundred thirty-two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •