Base | Representation |
---|---|
bin | 11000000000000110100000… |
… | …01000100001010000100001 |
3 | 20220212201112102202020202011 |
4 | 30000003100020201100201 |
5 | 23404222020301340203 |
6 | 304130453101352521 |
7 | 14055142561645222 |
oct | 1400032010412041 |
9 | 226781472666664 |
10 | 52780050027553 |
11 | 158a99912a4032 |
12 | 5b05163b68741 |
13 | 235b1a2a23b94 |
14 | d067d4a3b249 |
15 | 617de479676d |
hex | 3000d0221421 |
52780050027553 has 2 divisors, whose sum is σ = 52780050027554. Its totient is φ = 52780050027552.
The previous prime is 52780050027487. The next prime is 52780050027569. The reversal of 52780050027553 is 35572005008725.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31315574145024 + 21464475882529 = 5596032^2 + 4632977^2 .
It is a cyclic number.
It is not a de Polignac number, because 52780050027553 - 245 = 17595677938721 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52780050027497 and 52780050027506.
It is not a weakly prime, because it can be changed into another prime (52780050027253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26390025013776 + 26390025013777.
It is an arithmetic number, because the mean of its divisors is an integer number (26390025013777).
Almost surely, 252780050027553 is an apocalyptic number.
It is an amenable number.
52780050027553 is a deficient number, since it is larger than the sum of its proper divisors (1).
52780050027553 is an equidigital number, since it uses as much as digits as its factorization.
52780050027553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2940000, while the sum is 49.
The spelling of 52780050027553 in words is "fifty-two trillion, seven hundred eighty billion, fifty million, twenty-seven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •