Base | Representation |
---|---|
bin | 1100110000011… |
… | …0010111100101 |
3 | 10201200020221200 |
4 | 3030012113211 |
5 | 102144102321 |
6 | 5150433113 |
7 | 1216525524 |
oct | 314062745 |
9 | 121606850 |
10 | 53503461 |
11 | 28223a40 |
12 | 15b02799 |
13 | b113c6b |
14 | 716a4bb |
15 | 4a6cd26 |
hex | 33065e5 |
53503461 has 24 divisors (see below), whose sum is σ = 85388160. Its totient is φ = 32011200.
The previous prime is 53503441. The next prime is 53503477. The reversal of 53503461 is 16430535.
53503461 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 53503461 - 29 = 53502949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53503421) 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, 4401 + ... + 11241.
It is an arithmetic number, because the mean of its divisors is an integer number (3557840).
Almost surely, 253503461 is an apocalyptic number.
It is an amenable number.
53503461 is a deficient number, since it is larger than the sum of its proper divisors (31884699).
53503461 is a wasteful number, since it uses less digits than its factorization.
53503461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6937 (or 6934 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The square root of 53503461 is about 7314.6060044270. The cubic root of 53503461 is about 376.8142273895.
Adding to 53503461 its reverse (16430535), we get a palindrome (69933996).
It can be divided in two parts, 535034 and 61, that added together give a triangular number (535095 = T1034).
The spelling of 53503461 in words is "fifty-three million, five hundred three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •