Base | Representation |
---|---|
bin | 1100111101000… |
… | …0011010110001 |
3 | 10210020022012101 |
4 | 3033100122301 |
5 | 102402043212 |
6 | 5220300401 |
7 | 1226543404 |
oct | 317203261 |
9 | 123208171 |
10 | 54331057 |
11 | 28739800 |
12 | 16241701 |
13 | b343871 |
14 | 7303d3b |
15 | 4b83157 |
hex | 33d06b1 |
54331057 has 12 divisors (see below), whose sum is σ = 59971828. Its totient is φ = 49183200.
The previous prime is 54331033. The next prime is 54331073. The reversal of 54331057 is 75013345.
54331057 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 2 ways, for example, as 25160256 + 29170801 = 5016^2 + 5401^2 .
It is a de Polignac number, because none of the positive numbers 2k-54331057 is a prime.
It is a hoax number, since the sum of its digits (28) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54331087) 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 11 ways as a sum of consecutive naturals, for example, 32707 + ... + 34327.
Almost surely, 254331057 is an apocalyptic number.
It is an amenable number.
54331057 is a deficient number, since it is larger than the sum of its proper divisors (5640771).
54331057 is a wasteful number, since it uses less digits than its factorization.
54331057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1920 (or 1909 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 28.
The square root of 54331057 is about 7370.9603851873. The cubic root of 54331057 is about 378.7471597706.
The spelling of 54331057 in words is "fifty-four million, three hundred thirty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •