Base | Representation |
---|---|
bin | 1100101101100… |
… | …0000011111001 |
3 | 10201022121202122 |
4 | 3023120003321 |
5 | 102122020120 |
6 | 5142411025 |
7 | 1215105530 |
oct | 313300371 |
9 | 121277678 |
10 | 53313785 |
11 | 28104488 |
12 | 15a30a75 |
13 | b078825 |
14 | 711b317 |
15 | 4a31a25 |
hex | 32d80f9 |
53313785 has 16 divisors (see below), whose sum is σ = 77417856. Its totient is φ = 34407168.
The previous prime is 53313773. The next prime is 53313787. The reversal of 53313785 is 58731335.
53313785 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 53313785 - 216 = 53248249 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (53313787) 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 15 ways as a sum of consecutive naturals, for example, 44207 + ... + 45396.
It is an arithmetic number, because the mean of its divisors is an integer number (4838616).
Almost surely, 253313785 is an apocalyptic number.
It is an amenable number.
53313785 is a deficient number, since it is larger than the sum of its proper divisors (24104071).
53313785 is a wasteful number, since it uses less digits than its factorization.
53313785 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89632.
The product of its digits is 37800, while the sum is 35.
The square root of 53313785 is about 7301.6289278489. The cubic root of 53313785 is about 376.3684167175.
53313785 divided by its sum of digits (35) gives a palindrome (1523251).
The spelling of 53313785 in words is "fifty-three million, three hundred thirteen thousand, seven hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •