Base | Representation |
---|---|
bin | 10111010010101111011111… |
… | …00000001101101100111001 |
3 | 20201100201122121221022210221 |
4 | 23221113233200031230321 |
5 | 23203203114310013103 |
6 | 300534500030140041 |
7 | 13534426412352352 |
oct | 1351275740155471 |
9 | 221321577838727 |
10 | 51221503204153 |
11 | 15358a10242787 |
12 | 58b30a1951621 |
13 | 2277222c5a109 |
14 | c911c3912d29 |
15 | 5dc5c75451bd |
hex | 2e95ef80db39 |
51221503204153 has 2 divisors, whose sum is σ = 51221503204154. Its totient is φ = 51221503204152.
The previous prime is 51221503204121. The next prime is 51221503204229. The reversal of 51221503204153 is 35140230512215.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49972287915664 + 1249215288489 = 7069108^2 + 1117683^2 .
It is a cyclic number.
It is not a de Polignac number, because 51221503204153 - 25 = 51221503204121 is a prime.
It is a super-3 number, since 3×512215032041533 (a number of 42 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (51221503204453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25610751602076 + 25610751602077.
It is an arithmetic number, because the mean of its divisors is an integer number (25610751602077).
Almost surely, 251221503204153 is an apocalyptic number.
It is an amenable number.
51221503204153 is a deficient number, since it is larger than the sum of its proper divisors (1).
51221503204153 is an equidigital number, since it uses as much as digits as its factorization.
51221503204153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36000, while the sum is 34.
Adding to 51221503204153 its reverse (35140230512215), we get a palindrome (86361733716368).
The spelling of 51221503204153 in words is "fifty-one trillion, two hundred twenty-one billion, five hundred three million, two hundred four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •