Base | Representation |
---|---|
bin | 1100101010101… |
… | …0000001011111 |
3 | 10200222001002120 |
4 | 3022222001133 |
5 | 102100001330 |
6 | 5134354023 |
7 | 1213362003 |
oct | 312520137 |
9 | 120861076 |
10 | 53125215 |
11 | 27a95840 |
12 | 1595b913 |
13 | b010a50 |
14 | 70ac703 |
15 | 49e5c10 |
hex | 32aa05f |
53125215 has 32 divisors (see below), whose sum is σ = 99864576. Its totient is φ = 23775360.
The previous prime is 53125213. The next prime is 53125223. The reversal of 53125215 is 51252135.
It is a happy number.
53125215 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 53125215 - 21 = 53125213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53125213) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 10239 + ... + 14528.
It is an arithmetic number, because the mean of its divisors is an integer number (3120768).
Almost surely, 253125215 is an apocalyptic number.
53125215 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
53125215 is a deficient number, since it is larger than the sum of its proper divisors (46739361).
53125215 is a wasteful number, since it uses less digits than its factorization.
53125215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24799.
The product of its digits is 1500, while the sum is 24.
The square root of 53125215 is about 7288.7046174200. The cubic root of 53125215 is about 375.9241561789.
Subtracting from 53125215 its reverse (51252135), we obtain a triangular number (1873080 = T1935).
The spelling of 53125215 in words is "fifty-three million, one hundred twenty-five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •