Base | Representation |
---|---|
bin | 100000110001001… |
… | …111101000101100 |
3 | 1102022111201101200 |
4 | 200301033220230 |
5 | 2111220430022 |
6 | 130315405500 |
7 | 16424024115 |
oct | 4061175054 |
9 | 1368451350 |
10 | 549780012 |
11 | 262377951 |
12 | 134153890 |
13 | 89b94322 |
14 | 5303320c |
15 | 333ecbac |
hex | 20c4fa2c |
549780012 has 18 divisors (see below), whose sum is σ = 1389721788. Its totient is φ = 183259992.
The previous prime is 549780001. The next prime is 549780013. The reversal of 549780012 is 210087945.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 15271667 = 549780012 / (5 + 4 + 9 + 7 + 8 + 0 + 0 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (549780013) 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, 7635798 + ... + 7635869.
It is an arithmetic number, because the mean of its divisors is an integer number (77206766).
Almost surely, 2549780012 is an apocalyptic number.
It is an amenable number.
549780012 is an abundant number, since it is smaller than the sum of its proper divisors (839941776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
549780012 is a wasteful number, since it uses less digits than its factorization.
549780012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15271677 (or 15271672 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 549780012 is about 23447.3881701140. The cubic root of 549780012 is about 819.2120191559.
The spelling of 549780012 in words is "five hundred forty-nine million, seven hundred eighty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •