Base | Representation |
---|---|
bin | 110001011010111001… |
… | …111100100110010001 |
3 | 12001222011200110201011 |
4 | 301122321330212101 |
5 | 1332134033404114 |
6 | 40213321410521 |
7 | 3555664624252 |
oct | 613271744621 |
9 | 161864613634 |
10 | 53064747409 |
11 | 20560737153 |
12 | a34b339a41 |
13 | 50089a402b |
14 | 27d578cb29 |
15 | 15a89781c4 |
hex | c5ae7c991 |
53064747409 has 2 divisors, whose sum is σ = 53064747410. Its totient is φ = 53064747408.
The previous prime is 53064747391. The next prime is 53064747419. The reversal of 53064747409 is 90474746035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41861160000 + 11203587409 = 204600^2 + 105847^2 .
It is a cyclic number.
It is not a de Polignac number, because 53064747409 - 223 = 53056358801 is a prime.
It is not a weakly prime, because it can be changed into another prime (53064747419) 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, 26532373704 + 26532373705.
It is an arithmetic number, because the mean of its divisors is an integer number (26532373705).
Almost surely, 253064747409 is an apocalyptic number.
It is an amenable number.
53064747409 is a deficient number, since it is larger than the sum of its proper divisors (1).
53064747409 is an equidigital number, since it uses as much as digits as its factorization.
53064747409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2540160, while the sum is 49.
The spelling of 53064747409 in words is "fifty-three billion, sixty-four million, seven hundred forty-seven thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •