Base | Representation |
---|---|
bin | 10111101011010001011011… |
… | …11010111000001111100001 |
3 | 20211100022020001011122102012 |
4 | 23311220231322320033201 |
5 | 23311010304134042203 |
6 | 302422012201402305 |
7 | 13652345321565053 |
oct | 1365505572701741 |
9 | 224308201148365 |
10 | 52064363971553 |
11 | 1565341116839a |
12 | 5a0a50a199395 |
13 | 23088578715cb |
14 | cbdd003678d3 |
15 | 6044a855dbd8 |
hex | 2f5a2deb83e1 |
52064363971553 has 2 divisors, whose sum is σ = 52064363971554. Its totient is φ = 52064363971552.
The previous prime is 52064363971429. The next prime is 52064363971583. The reversal of 52064363971553 is 35517936346025.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 37669495452304 + 14394868519249 = 6137548^2 + 3794057^2 .
It is a cyclic number.
It is not a de Polignac number, because 52064363971553 - 210 = 52064363970529 is a prime.
It is a super-3 number, since 3×520643639715533 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 52064363971492 and 52064363971501.
It is not a weakly prime, because it can be changed into another prime (52064363971583) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26032181985776 + 26032181985777.
It is an arithmetic number, because the mean of its divisors is an integer number (26032181985777).
Almost surely, 252064363971553 is an apocalyptic number.
It is an amenable number.
52064363971553 is a deficient number, since it is larger than the sum of its proper divisors (1).
52064363971553 is an equidigital number, since it uses as much as digits as its factorization.
52064363971553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 61236000, while the sum is 59.
The spelling of 52064363971553 in words is "fifty-two trillion, sixty-four billion, three hundred sixty-three million, nine hundred seventy-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •