Base | Representation |
---|---|
bin | 11000000110110011110010… |
… | …11011000110000011011011 |
3 | 20221200202102112021101121121 |
4 | 30003121321123012003123 |
5 | 23422011023004404201 |
6 | 304424410500150111 |
7 | 14110612122154246 |
oct | 1403317133060333 |
9 | 227622375241547 |
10 | 53010523513051 |
11 | 159887005a5995 |
12 | 5b41965098337 |
13 | 2376b42538880 |
14 | d13a19dba25d |
15 | 61ddd31c19a1 |
hex | 3036796c60db |
53010523513051 has 32 divisors (see below), whose sum is σ = 61160491385280. Its totient is φ = 45512418226176.
The previous prime is 53010523513049. The next prime is 53010523513097. The reversal of 53010523513051 is 15031532501035.
53010523513051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 53010523513051 - 21 = 53010523513049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53010523512998 and 53010523513016.
It is not an unprimeable number, because it can be changed into a prime (53010523013051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6931105 + ... + 12412141.
It is an arithmetic number, because the mean of its divisors is an integer number (1911265355790).
Almost surely, 253010523513051 is an apocalyptic number.
53010523513051 is a deficient number, since it is larger than the sum of its proper divisors (8149967872229).
53010523513051 is a wasteful number, since it uses less digits than its factorization.
53010523513051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5481583.
The product of its (nonzero) digits is 33750, while the sum is 34.
The spelling of 53010523513051 in words is "fifty-three trillion, ten billion, five hundred twenty-three million, five hundred thirteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •