Base | Representation |
---|---|
bin | 110000111011011001… |
… | …001011011000100101 |
3 | 12000121022212112202120 |
4 | 300323121023120211 |
5 | 1330043213013100 |
6 | 40045034100153 |
7 | 3536615112651 |
oct | 607331133045 |
9 | 160538775676 |
10 | 52536063525 |
11 | 2030a269120 |
12 | a22227a659 |
13 | 4c532b802a |
14 | 278548ba61 |
15 | 15773460a0 |
hex | c3b64b625 |
52536063525 has 96 divisors (see below), whose sum is σ = 104080481280. Its totient is φ = 23082048000.
The previous prime is 52536063491. The next prime is 52536063539.
52536063525 is nontrivially palindromic in base 10.
52536063525 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 52536063525 - 211 = 52536061477 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 287665 + ... + 433385.
It is an arithmetic number, because the mean of its divisors is an integer number (1084171680).
Almost surely, 252536063525 is an apocalyptic number.
52536063525 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
52536063525 is a deficient number, since it is larger than the sum of its proper divisors (51544417755).
52536063525 is a wasteful number, since it uses less digits than its factorization.
52536063525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145787 (or 145782 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 42.
Subtracting from 52536063525 its product of nonzero digits (810000), we obtain a palindrome (52535253525).
It can be divided in two parts, 525360 and 63525, that added together give a palindrome (588885).
The spelling of 52536063525 in words is "fifty-two billion, five hundred thirty-six million, sixty-three thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •