Base | Representation |
---|---|
bin | 1100110100010… |
… | …1110000110101 |
3 | 10202011110010212 |
4 | 3031011300311 |
5 | 102230410000 |
6 | 5200155205 |
7 | 1221656543 |
oct | 315056065 |
9 | 122143125 |
10 | 53763125 |
11 | 28391039 |
12 | 16008b05 |
13 | b1a5200 |
14 | 71d6d93 |
15 | 4abec35 |
hex | 3345c35 |
53763125 has 30 divisors (see below), whose sum is σ = 72890730. Its totient is φ = 39624000.
The previous prime is 53763107. The next prime is 53763131. The reversal of 53763125 is 52136735.
53763125 = T181 + T182 + ... + T689.
53763125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 15 ways, for example, as 53085796 + 677329 = 7286^2 + 823^2 .
It is not a de Polignac number, because 53763125 - 28 = 53762869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53763091 and 53763100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 105371 + ... + 105879.
It is an arithmetic number, because the mean of its divisors is an integer number (2429691).
Almost surely, 253763125 is an apocalyptic number.
It is an amenable number.
53763125 is a deficient number, since it is larger than the sum of its proper divisors (19127605).
53763125 is an equidigital number, since it uses as much as digits as its factorization.
53763125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555 (or 527 counting only the distinct ones).
The product of its digits is 18900, while the sum is 32.
The square root of 53763125 is about 7332.3342122410. The cubic root of 53763125 is about 377.4228311773.
The spelling of 53763125 in words is "fifty-three million, seven hundred sixty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •