Base | Representation |
---|---|
bin | 100000101110100… |
… | …010010101000010 |
3 | 1102021011122122100 |
4 | 200232202111002 |
5 | 2111030221041 |
6 | 130252251230 |
7 | 16415006412 |
oct | 4056422502 |
9 | 1367148570 |
10 | 549070146 |
11 | 261a32589 |
12 | 133a70b16 |
13 | 899a61a1 |
14 | 52cca642 |
15 | 3330c6b6 |
hex | 20ba2542 |
549070146 has 12 divisors (see below), whose sum is σ = 1189652022. Its totient is φ = 183023376.
The previous prime is 549070141. The next prime is 549070147. The reversal of 549070146 is 641070945.
549070146 is a `hidden beast` number, since 549 + 0 + 70 + 1 + 46 = 666.
It can be written as a sum of positive squares in only one way, i.e., 365765625 + 183304521 = 19125^2 + 13539^2 .
It is a super-2 number, since 2×5490701462 = 602956050456922632, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 549070146.
It is not an unprimeable number, because it can be changed into a prime (549070141) 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 5 ways as a sum of consecutive naturals, for example, 15251931 + ... + 15251966.
Almost surely, 2549070146 is an apocalyptic number.
549070146 is an abundant number, since it is smaller than the sum of its proper divisors (640581876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
549070146 is a wasteful number, since it uses less digits than its factorization.
549070146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30503905 (or 30503902 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 549070146 is about 23432.2458590721. The cubic root of 549070146 is about 818.8592833867.
The spelling of 549070146 in words is "five hundred forty-nine million, seventy thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •