Base | Representation |
---|---|
bin | 1100101110010… |
… | …0101110010010 |
3 | 10201102020220120 |
4 | 3023210232102 |
5 | 102130200100 |
6 | 5143451110 |
7 | 1215412662 |
oct | 313445622 |
9 | 121366816 |
10 | 53365650 |
11 | 2813a448 |
12 | 15a56a96 |
13 | b096310 |
14 | 71321a2 |
15 | 4a420a0 |
hex | 32e4b92 |
53365650 has 48 divisors (see below), whose sum is σ = 142532544. Its totient is φ = 13135680.
The previous prime is 53365649. The next prime is 53365651. The reversal of 53365650 is 5656335.
53365650 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 (53365649) and next prime (53365651).
It is not an unprimeable number, because it can be changed into a prime (53365651) 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 23 ways as a sum of consecutive naturals, for example, 11734 + ... + 15633.
It is an arithmetic number, because the mean of its divisors is an integer number (2969428).
Almost surely, 253365650 is an apocalyptic number.
53365650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53365650 is an abundant number, since it is smaller than the sum of its proper divisors (89166894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53365650 is a wasteful number, since it uses less digits than its factorization.
53365650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27395 (or 27390 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 33.
The square root of 53365650 is about 7305.1796692484. The cubic root of 53365650 is about 376.4904240707.
The spelling of 53365650 in words is "fifty-three million, three hundred sixty-five thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •