Base | Representation |
---|---|
bin | 10111010100001110011001… |
… | …11010101010000111010101 |
3 | 20201112121012001220212120002 |
4 | 23222013030322222013111 |
5 | 23210022000402310034 |
6 | 301014124421421045 |
7 | 13541212263520334 |
oct | 1352071472520725 |
9 | 221477161825502 |
10 | 51272462541269 |
11 | 15378590485a22 |
12 | 5900b43b6a785 |
13 | 227bc8469a828 |
14 | c93859807d1b |
15 | 5ddaab237e7e |
hex | 2ea1cceaa1d5 |
51272462541269 has 2 divisors, whose sum is σ = 51272462541270. Its totient is φ = 51272462541268.
The previous prime is 51272462541259. The next prime is 51272462541317. The reversal of 51272462541269 is 96214526427215.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49782366258244 + 1490096283025 = 7055662^2 + 1220695^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51272462541269 is a prime.
It is a super-2 number, since 2×512724625412692 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51272462541259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25636231270634 + 25636231270635.
It is an arithmetic number, because the mean of its divisors is an integer number (25636231270635).
Almost surely, 251272462541269 is an apocalyptic number.
It is an amenable number.
51272462541269 is a deficient number, since it is larger than the sum of its proper divisors (1).
51272462541269 is an equidigital number, since it uses as much as digits as its factorization.
51272462541269 is an evil number, because the sum of its binary digits is even.
The product of its digits is 14515200, while the sum is 56.
The spelling of 51272462541269 in words is "fifty-one trillion, two hundred seventy-two billion, four hundred sixty-two million, five hundred forty-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •