Base | Representation |
---|---|
bin | 1100110011001… |
… | …1001100000001 |
3 | 10202000120202221 |
4 | 3030303030001 |
5 | 102220441131 |
6 | 5154411041 |
7 | 1221221662 |
oct | 314631401 |
9 | 122016687 |
10 | 53687041 |
11 | 28339961 |
12 | 15b90a81 |
13 | b1796a5 |
14 | 71b7369 |
15 | 4aa7411 |
hex | 3333301 |
53687041 has 4 divisors (see below), whose sum is σ = 53701972. Its totient is φ = 53672112.
The previous prime is 53686961. The next prime is 53687059. The reversal of 53687041 is 14078635.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 8850625 + 44836416 = 2975^2 + 6696^2 .
It is a cyclic number.
It is not a de Polignac number, because 53687041 - 211 = 53684993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53686988 and 53687006.
It is not an unprimeable number, because it can be changed into a prime (53687441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1591 + ... + 10483.
It is an arithmetic number, because the mean of its divisors is an integer number (13425493).
Almost surely, 253687041 is an apocalyptic number.
It is an amenable number.
53687041 is a deficient number, since it is larger than the sum of its proper divisors (14931).
53687041 is an equidigital number, since it uses as much as digits as its factorization.
53687041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14930.
The product of its (nonzero) digits is 20160, while the sum is 34.
The square root of 53687041 is about 7327.1441230537. The cubic root of 53687041 is about 377.2447078801.
The spelling of 53687041 in words is "fifty-three million, six hundred eighty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •