Base | Representation |
---|---|
bin | 110001010111111110… |
… | …000101111100110001 |
3 | 12001211202000120120212 |
4 | 301113332011330301 |
5 | 1332033432041031 |
6 | 40204402113505 |
7 | 3554526223433 |
oct | 612776057461 |
9 | 161752016525 |
10 | 53015502641 |
11 | 205359618a2 |
12 | a33694b895 |
13 | 4ccb72160a |
14 | 27cd010653 |
15 | 15a449c12b |
hex | c57f85f31 |
53015502641 has 2 divisors, whose sum is σ = 53015502642. Its totient is φ = 53015502640.
The previous prime is 53015502637. The next prime is 53015502679. The reversal of 53015502641 is 14620551035.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48806088241 + 4209414400 = 220921^2 + 64880^2 .
It is a cyclic number.
It is not a de Polignac number, because 53015502641 - 22 = 53015502637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53015502598 and 53015502607.
It is not a weakly prime, because it can be changed into another prime (53015502601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26507751320 + 26507751321.
It is an arithmetic number, because the mean of its divisors is an integer number (26507751321).
Almost surely, 253015502641 is an apocalyptic number.
It is an amenable number.
53015502641 is a deficient number, since it is larger than the sum of its proper divisors (1).
53015502641 is an equidigital number, since it uses as much as digits as its factorization.
53015502641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 53015502641 in words is "fifty-three billion, fifteen million, five hundred two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •