Base | Representation |
---|---|
bin | 10111010101110000101101… |
… | …10010000100101101110101 |
3 | 20201201122102022200022211111 |
4 | 23222320112302010231311 |
5 | 23211403043300144334 |
6 | 301054253532035021 |
7 | 13545061220521363 |
oct | 1352702662045565 |
9 | 221648368608744 |
10 | 51325241412469 |
11 | 15398a04805042 |
12 | 590b213602a71 |
13 | 2283c4607a62b |
14 | c9622521c633 |
15 | 5e0149a42064 |
hex | 2eae16c84b75 |
51325241412469 has 2 divisors, whose sum is σ = 51325241412470. Its totient is φ = 51325241412468.
The previous prime is 51325241412443. The next prime is 51325241412493. The reversal of 51325241412469 is 96421414252315.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46416083314225 + 4909158098244 = 6812935^2 + 2215662^2 .
It is a cyclic number.
It is not a de Polignac number, because 51325241412469 - 29 = 51325241411957 is a prime.
It is a super-3 number, since 3×513252414124693 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51325241412169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25662620706234 + 25662620706235.
It is an arithmetic number, because the mean of its divisors is an integer number (25662620706235).
Almost surely, 251325241412469 is an apocalyptic number.
It is an amenable number.
51325241412469 is a deficient number, since it is larger than the sum of its proper divisors (1).
51325241412469 is an equidigital number, since it uses as much as digits as its factorization.
51325241412469 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2073600, while the sum is 49.
The spelling of 51325241412469 in words is "fifty-one trillion, three hundred twenty-five billion, two hundred forty-one million, four hundred twelve thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •