Base | Representation |
---|---|
bin | 100000110011110… |
… | …111000111010100 |
3 | 1102100210120101210 |
4 | 200303313013110 |
5 | 2111404403004 |
6 | 130342221420 |
7 | 16432612104 |
oct | 4063670724 |
9 | 1370716353 |
10 | 550466004 |
11 | 2627a6290 |
12 | 134424870 |
13 | 8a07463a |
14 | 53171204 |
15 | 334d6089 |
hex | 20cf71d4 |
550466004 has 48 divisors (see below), whose sum is σ = 1402914240. Its totient is φ = 166602240.
The previous prime is 550465999. The next prime is 550466009. The reversal of 550466004 is 400664055.
550466004 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (550465999) and next prime (550466009).
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550466009) 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, 131122 + ... + 135254.
It is an arithmetic number, because the mean of its divisors is an integer number (29227380).
Almost surely, 2550466004 is an apocalyptic number.
It is an amenable number.
550466004 is an abundant number, since it is smaller than the sum of its proper divisors (852448236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550466004 is a wasteful number, since it uses less digits than its factorization.
550466004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5160 (or 5158 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 550466004 is about 23462.0119341884. The cubic root of 550466004 is about 819.5526034538.
The spelling of 550466004 in words is "five hundred fifty million, four hundred sixty-six thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •