Base | Representation |
---|---|
bin | 11000000111000011000111… |
… | …10011000001000110011101 |
3 | 20221201112122220000201202122 |
4 | 30003201203303001012131 |
5 | 23422124400124320221 |
6 | 304432251111432325 |
7 | 14111323031341052 |
oct | 1403414363010635 |
9 | 227645586021678 |
10 | 53018750620061 |
11 | 15991142590186 |
12 | 5b434803856a5 |
13 | 2377853b37225 |
14 | d1419a8c1029 |
15 | 61e2155cceab |
hex | 303863cc119d |
53018750620061 has 2 divisors, whose sum is σ = 53018750620062. Its totient is φ = 53018750620060.
The previous prime is 53018750619983. The next prime is 53018750620063. The reversal of 53018750620061 is 16002605781035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41751382863961 + 11267367756100 = 6461531^2 + 3356690^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53018750620061 is a prime.
Together with 53018750620063, 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 = 53018750619994 and 53018750620021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53018750620063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26509375310030 + 26509375310031.
It is an arithmetic number, because the mean of its divisors is an integer number (26509375310031).
Almost surely, 253018750620061 is an apocalyptic number.
It is an amenable number.
53018750620061 is a deficient number, since it is larger than the sum of its proper divisors (1).
53018750620061 is an equidigital number, since it uses as much as digits as its factorization.
53018750620061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 302400, while the sum is 44.
The spelling of 53018750620061 in words is "fifty-three trillion, eighteen billion, seven hundred fifty million, six hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •