Base | Representation |
---|---|
bin | 100000110011001… |
… | …001010110001101 |
3 | 1102100110001020201 |
4 | 200303021112031 |
5 | 2111332403131 |
6 | 130334213501 |
7 | 16431201421 |
oct | 4063112615 |
9 | 1370401221 |
10 | 550278541 |
11 | 26268845a |
12 | 134354291 |
13 | 8a00a207 |
14 | 53122b81 |
15 | 3349a761 |
hex | 20cc958d |
550278541 has 8 divisors (see below), whose sum is σ = 565995104. Its totient is φ = 534606480.
The previous prime is 550278539. The next prime is 550278583. The reversal of 550278541 is 145872055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 550278541 - 21 = 550278539 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 550278541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550278341) 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 7 ways as a sum of consecutive naturals, for example, 14806 + ... + 36328.
It is an arithmetic number, because the mean of its divisors is an integer number (70749388).
Almost surely, 2550278541 is an apocalyptic number.
It is an amenable number.
550278541 is a deficient number, since it is larger than the sum of its proper divisors (15716563).
550278541 is a wasteful number, since it uses less digits than its factorization.
550278541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22251.
The product of its (nonzero) digits is 56000, while the sum is 37.
The square root of 550278541 is about 23458.0165615083. The cubic root of 550278541 is about 819.4595591166.
The spelling of 550278541 in words is "five hundred fifty million, two hundred seventy-eight thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •