Base | Representation |
---|---|
bin | 10111111000101011100001… |
… | …11110101000000100110101 |
3 | 20212222100100002012111121202 |
4 | 23330111300332220010311 |
5 | 23341032300413344203 |
6 | 303413401453222245 |
7 | 14030544500654165 |
oct | 1374256076500465 |
9 | 225870302174552 |
10 | 52525050528053 |
11 | 15810826774914 |
12 | 5a83859191985 |
13 | 2340124c5017c |
14 | cd83242585a5 |
15 | 61146cac4388 |
hex | 2fc570fa8135 |
52525050528053 has 2 divisors, whose sum is σ = 52525050528054. Its totient is φ = 52525050528052.
The previous prime is 52525050528023. The next prime is 52525050528061. The reversal of 52525050528053 is 35082505052525.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 45820146207364 + 6704904320689 = 6769058^2 + 2589383^2 .
It is a cyclic number.
It is not a de Polignac number, because 52525050528053 - 28 = 52525050527797 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 52525050527989 and 52525050528007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52525050528023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26262525264026 + 26262525264027.
It is an arithmetic number, because the mean of its divisors is an integer number (26262525264027).
Almost surely, 252525050528053 is an apocalyptic number.
It is an amenable number.
52525050528053 is a deficient number, since it is larger than the sum of its proper divisors (1).
52525050528053 is an equidigital number, since it uses as much as digits as its factorization.
52525050528053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3000000, while the sum is 47.
The spelling of 52525050528053 in words is "fifty-two trillion, five hundred twenty-five billion, fifty million, five hundred twenty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •