Base | Representation |
---|---|
bin | 1100101011111… |
… | …0000001010101 |
3 | 10201010012110021 |
4 | 3022332001111 |
5 | 102110112000 |
6 | 5140225141 |
7 | 1214152546 |
oct | 312760125 |
9 | 121105407 |
10 | 53207125 |
11 | 28041334 |
12 | 1599b1b1 |
13 | b03c10a |
14 | 70d04cd |
15 | 4a1011a |
hex | 32be055 |
53207125 has 32 divisors (see below), whose sum is σ = 71660160. Its totient is φ = 39312000.
The previous prime is 53207123. The next prime is 53207153. The reversal of 53207125 is 52170235.
53207125 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 53207125 - 21 = 53207123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 53207125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53207123) 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, 101865 + ... + 102385.
It is an arithmetic number, because the mean of its divisors is an integer number (2239380).
Almost surely, 253207125 is an apocalyptic number.
It is an amenable number.
53207125 is a deficient number, since it is larger than the sum of its proper divisors (18453035).
53207125 is a wasteful number, since it uses less digits than its factorization.
53207125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598 (or 588 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 25.
The square root of 53207125 is about 7294.3214214895. The cubic root of 53207125 is about 376.1172605637.
The spelling of 53207125 in words is "fifty-three million, two hundred seven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •