Base | Representation |
---|---|
bin | 10111010011101100111111… |
… | …00110100110101000110001 |
3 | 20201110212212210110022110212 |
4 | 23221312133212212220301 |
5 | 23204223230221041431 |
6 | 301002000315033505 |
7 | 13540005563261651 |
oct | 1351663746465061 |
9 | 221425783408425 |
10 | 51254522440241 |
11 | 15370a1479554a |
12 | 58b9577a3b895 |
13 | 227a3859b0233 |
14 | c92a36d30361 |
15 | 5dd3ab26272b |
hex | 2e9d9f9a6a31 |
51254522440241 has 2 divisors, whose sum is σ = 51254522440242. Its totient is φ = 51254522440240.
The previous prime is 51254522440207. The next prime is 51254522440259. The reversal of 51254522440241 is 14204422545215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36980263699600 + 14274258740641 = 6081140^2 + 3778129^2 .
It is a cyclic number.
It is not a de Polignac number, because 51254522440241 - 214 = 51254522423857 is a prime.
It is a super-2 number, since 2×512545224402412 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51254522440141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25627261220120 + 25627261220121.
It is an arithmetic number, because the mean of its divisors is an integer number (25627261220121).
Almost surely, 251254522440241 is an apocalyptic number.
It is an amenable number.
51254522440241 is a deficient number, since it is larger than the sum of its proper divisors (1).
51254522440241 is an equidigital number, since it uses as much as digits as its factorization.
51254522440241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512000, while the sum is 41.
Adding to 51254522440241 its reverse (14204422545215), we get a palindrome (65458944985456).
The spelling of 51254522440241 in words is "fifty-one trillion, two hundred fifty-four billion, five hundred twenty-two million, four hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •