Base | Representation |
---|---|
bin | 110001011000011000… |
… | …000010001101000001 |
3 | 12001212012211001222112 |
4 | 301120120002031001 |
5 | 1332042202144131 |
6 | 40205203545105 |
7 | 3554641065611 |
oct | 613030021501 |
9 | 161765731875 |
10 | 53022303041 |
11 | 20539787064 |
12 | a33908b195 |
13 | 4cccc62a16 |
14 | 27cdca0a41 |
15 | 15a4d9202b |
hex | c58602341 |
53022303041 has 2 divisors, whose sum is σ = 53022303042. Its totient is φ = 53022303040.
The previous prime is 53022303011. The next prime is 53022303043. The reversal of 53022303041 is 14030322035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49479553600 + 3542749441 = 222440^2 + 59521^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53022303041 is a prime.
It is a super-2 number, since 2×530223030412 (a number of 22 digits) contains 22 as substring.
Together with 53022303043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 53022302998 and 53022303016.
It is not a weakly prime, because it can be changed into another prime (53022303043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26511151520 + 26511151521.
It is an arithmetic number, because the mean of its divisors is an integer number (26511151521).
Almost surely, 253022303041 is an apocalyptic number.
It is an amenable number.
53022303041 is a deficient number, since it is larger than the sum of its proper divisors (1).
53022303041 is an equidigital number, since it uses as much as digits as its factorization.
53022303041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 53022303041 its reverse (14030322035), we get a palindrome (67052625076).
The spelling of 53022303041 in words is "fifty-three billion, twenty-two million, three hundred three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •