Base | Representation |
---|---|
bin | 1101000000011… |
… | …1011111100001 |
3 | 10210122202122100 |
4 | 3100013133201 |
5 | 102431303031 |
6 | 5225201013 |
7 | 1231503156 |
oct | 320073741 |
9 | 123582570 |
10 | 54556641 |
11 | 28883237 |
12 | 16330169 |
13 | b3c2449 |
14 | 736222d |
15 | 4bc9de6 |
hex | 34077e1 |
54556641 has 6 divisors (see below), whose sum is σ = 78804050. Its totient is φ = 36371088.
The previous prime is 54556639. The next prime is 54556669. The reversal of 54556641 is 14665545.
54556641 is a `hidden beast` number, since 5 + 4 + 5 + 5 + 6 + 641 = 666.
54556641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 47900241 + 6656400 = 6921^2 + 2580^2 .
It is not a de Polignac number, because 54556641 - 21 = 54556639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54556596 and 54556605.
It is not an unprimeable number, because it can be changed into a prime (54556681) 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 5 ways as a sum of consecutive naturals, for example, 3030916 + ... + 3030933.
Almost surely, 254556641 is an apocalyptic number.
It is an amenable number.
54556641 is a deficient number, since it is larger than the sum of its proper divisors (24247409).
54556641 is a wasteful number, since it uses less digits than its factorization.
54556641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6061855 (or 6061852 counting only the distinct ones).
The product of its digits is 72000, while the sum is 36.
The square root of 54556641 is about 7386.2467464877. The cubic root of 54556641 is about 379.2706253982.
The spelling of 54556641 in words is "fifty-four million, five hundred fifty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •