Base | Representation |
---|---|
bin | 100000110010000… |
… | …110010001010000 |
3 | 1102022221002100211 |
4 | 200302012101100 |
5 | 2111300110132 |
6 | 130324253504 |
7 | 16425645412 |
oct | 4062062120 |
9 | 1368832324 |
10 | 550003792 |
11 | 26250aa98 |
12 | 134241294 |
13 | 89c42140 |
14 | 530909b2 |
15 | 33444147 |
hex | 20c86450 |
550003792 has 80 divisors (see below), whose sum is σ = 1249920000. Its totient is φ = 232146432.
The previous prime is 550003757. The next prime is 550003799. The reversal of 550003792 is 297300055.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550003799) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 112209 + ... + 117007.
It is an arithmetic number, because the mean of its divisors is an integer number (15624000).
Almost surely, 2550003792 is an apocalyptic number.
550003792 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 550003792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (624960000).
550003792 is an abundant number, since it is smaller than the sum of its proper divisors (699916208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550003792 is a wasteful number, since it uses less digits than its factorization.
550003792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4868 (or 4862 counting only the distinct ones).
The product of its (nonzero) digits is 9450, while the sum is 31.
The square root of 550003792 is about 23452.1596446894. The cubic root of 550003792 is about 819.3231535456.
The spelling of 550003792 in words is "five hundred fifty million, three thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •