Base | Representation |
---|---|
bin | 1100101001011… |
… | …1101011000010 |
3 | 10200211012222200 |
4 | 3022113223002 |
5 | 102040100200 |
6 | 5133014030 |
7 | 1212626604 |
oct | 312275302 |
9 | 120735880 |
10 | 53050050 |
11 | 27a44319 |
12 | 15924316 |
13 | acb5781 |
14 | 708d174 |
15 | 49cd800 |
hex | 3297ac2 |
53050050 has 36 divisors (see below), whose sum is σ = 142529010. Its totient is φ = 14146560.
The previous prime is 53050043. The next prime is 53050073. The reversal of 53050050 is 5005035.
53050050 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 3 ways, for example, as 33628401 + 19421649 = 5799^2 + 4407^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon 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 17 ways as a sum of consecutive naturals, for example, 58495 + ... + 59394.
Almost surely, 253050050 is an apocalyptic number.
53050050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53050050 is an abundant number, since it is smaller than the sum of its proper divisors (89478960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53050050 is a wasteful number, since it uses less digits than its factorization.
53050050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117907 (or 117899 counting only the distinct ones).
The product of its (nonzero) digits is 375, while the sum is 18.
The square root of 53050050 is about 7283.5465262467. The cubic root of 53050050 is about 375.7467785377.
Adding to 53050050 its reverse (5005035), we get a palindrome (58055085).
The spelling of 53050050 in words is "fifty-three million, fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •