Base | Representation |
---|---|
bin | 100000101111101… |
… | …101111111011001 |
3 | 1102021202101202112 |
4 | 200233231333121 |
5 | 2111120130212 |
6 | 130303042105 |
7 | 16420440062 |
oct | 4057557731 |
9 | 1367671675 |
10 | 549380057 |
11 | 262124406 |
12 | 133ba0335 |
13 | 89a84275 |
14 | 52d6b569 |
15 | 3336e422 |
hex | 20bedfd9 |
549380057 has 4 divisors (see below), whose sum is σ = 549527220. Its totient is φ = 549232896.
The previous prime is 549380053. The next prime is 549380077. The reversal of 549380057 is 750083945.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 331640521 + 217739536 = 18211^2 + 14756^2 .
It is a cyclic number.
It is not a de Polignac number, because 549380057 - 22 = 549380053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 549379996 and 549380023.
It is not an unprimeable number, because it can be changed into a prime (549380053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67832 + ... + 75497.
It is an arithmetic number, because the mean of its divisors is an integer number (137381805).
Almost surely, 2549380057 is an apocalyptic number.
It is an amenable number.
549380057 is a deficient number, since it is larger than the sum of its proper divisors (147163).
549380057 is a wasteful number, since it uses less digits than its factorization.
549380057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147162.
The product of its (nonzero) digits is 151200, while the sum is 41.
The square root of 549380057 is about 23438.8578433336. The cubic root of 549380057 is about 819.0133169958.
The spelling of 549380057 in words is "five hundred forty-nine million, three hundred eighty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •