Base | Representation |
---|---|
bin | 110001011000011111… |
… | …011110011001001001 |
3 | 12001212100111011112020 |
4 | 301120133132121021 |
5 | 1332043202103023 |
6 | 40205313435053 |
7 | 3554663501250 |
oct | 613037363111 |
9 | 161770434466 |
10 | 53024253513 |
11 | 2053a899520 |
12 | a33986ba89 |
13 | 500049674a |
14 | 27d024b797 |
15 | 15a5129de3 |
hex | c587de649 |
53024253513 has 32 divisors (see below), whose sum is σ = 88161841152. Its totient is φ = 27539558400.
The previous prime is 53024253511. The next prime is 53024253517. The reversal of 53024253513 is 31535242035.
It is not a de Polignac number, because 53024253513 - 21 = 53024253511 is a prime.
It is a super-2 number, since 2×530242535132 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (53024253511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1299145 + ... + 1339337.
It is an arithmetic number, because the mean of its divisors is an integer number (2755057536).
Almost surely, 253024253513 is an apocalyptic number.
It is an amenable number.
53024253513 is a deficient number, since it is larger than the sum of its proper divisors (35137587639).
53024253513 is a wasteful number, since it uses less digits than its factorization.
53024253513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45925.
The product of its (nonzero) digits is 54000, while the sum is 33.
Adding to 53024253513 its reverse (31535242035), we get a palindrome (84559495548).
The spelling of 53024253513 in words is "fifty-three billion, twenty-four million, two hundred fifty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.305 sec. • engine limits •