Base | Representation |
---|---|
bin | 110000110011010010… |
… | …101011010011011011 |
3 | 12000020212002222211122 |
4 | 300303102223103123 |
5 | 1324303414012111 |
6 | 40023340515455 |
7 | 3533344565633 |
oct | 606322532333 |
9 | 160225088748 |
10 | 52400141531 |
11 | 2024a5719a1 |
12 | a1a484bb8b |
13 | 4c310a7c0a |
14 | 27713c96c3 |
15 | 156a447cdb |
hex | c334ab4db |
52400141531 has 2 divisors, whose sum is σ = 52400141532. Its totient is φ = 52400141530.
The previous prime is 52400141513. The next prime is 52400141561. The reversal of 52400141531 is 13514100425.
Together with previous prime (52400141513) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 52400141531 - 26 = 52400141467 is a prime.
It is a super-2 number, since 2×524001415312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 52400141531.
It is not a weakly prime, because it can be changed into another prime (52400141561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26200070765 + 26200070766.
It is an arithmetic number, because the mean of its divisors is an integer number (26200070766).
Almost surely, 252400141531 is an apocalyptic number.
52400141531 is a deficient number, since it is larger than the sum of its proper divisors (1).
52400141531 is an equidigital number, since it uses as much as digits as its factorization.
52400141531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 52400141531 its reverse (13514100425), we get a palindrome (65914241956).
The spelling of 52400141531 in words is "fifty-two billion, four hundred million, one hundred forty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •