Base | Representation |
---|---|
bin | 1100110000101… |
… | …0011011001011 |
3 | 10201201002202000 |
4 | 3030022123023 |
5 | 102200120300 |
6 | 5151042043 |
7 | 1216625130 |
oct | 314123313 |
9 | 121632660 |
10 | 53520075 |
11 | 28235474 |
12 | 15b10323 |
13 | b11b6ab |
14 | 7172587 |
15 | 4a72c00 |
hex | 330a6cb |
53520075 has 96 divisors (see below), whose sum is σ = 115230720. Its totient is φ = 23846400.
The previous prime is 53520067. The next prime is 53520083. The reversal of 53520075 is 57002535.
53520075 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (53520067) and next prime (53520083).
It is not a de Polignac number, because 53520075 - 23 = 53520067 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 95 ways as a sum of consecutive naturals, for example, 221955 + ... + 222195.
It is an arithmetic number, because the mean of its divisors is an integer number (1200320).
Almost surely, 253520075 is an apocalyptic number.
53520075 is an abundant number, since it is smaller than the sum of its proper divisors (61710645).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53520075 is a wasteful number, since it uses less digits than its factorization.
53520075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314 (or 303 counting only the distinct ones).
The product of its (nonzero) digits is 5250, while the sum is 27.
The square root of 53520075 is about 7315.7415892034. The cubic root of 53520075 is about 376.8532263850.
The spelling of 53520075 in words is "fifty-three million, five hundred twenty thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •