Base | Representation |
---|---|
bin | 1101000001110… |
… | …0101101101001 |
3 | 10210211011212121 |
4 | 3100130231221 |
5 | 102442043221 |
6 | 5231111241 |
7 | 1232314450 |
oct | 320345551 |
9 | 123734777 |
10 | 54643561 |
11 | 28932575 |
12 | 16372521 |
13 | b422b8b |
14 | 7385b97 |
15 | 4be5a41 |
hex | 341cb69 |
54643561 has 16 divisors (see below), whose sum is σ = 66933504. Its totient is φ = 43585344.
The previous prime is 54643549. The next prime is 54643573. The reversal of 54643561 is 16534645.
54643561 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 (54643549) and next prime (54643573).
It is a cyclic number.
It is not a de Polignac number, because 54643561 - 211 = 54641513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54643591) 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, 1371 + ... + 10543.
It is an arithmetic number, because the mean of its divisors is an integer number (4183344).
Almost surely, 254643561 is an apocalyptic number.
It is an amenable number.
54643561 is a deficient number, since it is larger than the sum of its proper divisors (12289943).
54643561 is a wasteful number, since it uses less digits than its factorization.
54643561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9240.
The product of its digits is 43200, while the sum is 34.
The square root of 54643561 is about 7392.1283132803. The cubic root of 54643561 is about 379.4719373455.
It can be divided in two parts, 5464 and 3561, that added together give a square (9025 = 952).
The spelling of 54643561 in words is "fifty-four million, six hundred forty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •