Base | Representation |
---|---|
bin | 11000000111001101110111… |
… | …11000011101111100111111 |
3 | 20221202002120012112220120012 |
4 | 30003212323320131330333 |
5 | 23422223210443130023 |
6 | 304435044010413435 |
7 | 14111616056300105 |
oct | 1403467370357477 |
9 | 227662505486505 |
10 | 53024523411263 |
11 | 159936351346a8 |
12 | 5b4461173127b |
13 | 2378263b10301 |
14 | d14587467c75 |
15 | 61e4522d4978 |
hex | 3039bbe1df3f |
53024523411263 has 2 divisors, whose sum is σ = 53024523411264. Its totient is φ = 53024523411262.
The previous prime is 53024523411253. The next prime is 53024523411373. The reversal of 53024523411263 is 36211432542035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 53024523411263 - 222 = 53024519216959 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53024523411263.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53024523411253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26512261705631 + 26512261705632.
It is an arithmetic number, because the mean of its divisors is an integer number (26512261705632).
Almost surely, 253024523411263 is an apocalyptic number.
53024523411263 is a deficient number, since it is larger than the sum of its proper divisors (1).
53024523411263 is an equidigital number, since it uses as much as digits as its factorization.
53024523411263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 518400, while the sum is 41.
Adding to 53024523411263 its reverse (36211432542035), we get a palindrome (89235955953298).
The spelling of 53024523411263 in words is "fifty-three trillion, twenty-four billion, five hundred twenty-three million, four hundred eleven thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •