Base | Representation |
---|---|
bin | 100000110011101… |
… | …111001101101000 |
3 | 1102100201221000010 |
4 | 200303233031220 |
5 | 2111402334030 |
6 | 130341411520 |
7 | 16432415541 |
oct | 4063571550 |
9 | 1370657003 |
10 | 550433640 |
11 | 262783a39 |
12 | 134409ba0 |
13 | 8a0629a3 |
14 | 531634c8 |
15 | 334cb6b0 |
hex | 20cef368 |
550433640 has 32 divisors (see below), whose sum is σ = 1651301280. Its totient is φ = 146782272.
The previous prime is 550433627. The next prime is 550433641. The reversal of 550433640 is 46334055.
550433640 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 550433598 and 550433607.
It is not an unprimeable number, because it can be changed into a prime (550433641) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2293354 + ... + 2293593.
It is an arithmetic number, because the mean of its divisors is an integer number (51603165).
Almost surely, 2550433640 is an apocalyptic number.
It is an amenable number.
550433640 is an abundant number, since it is smaller than the sum of its proper divisors (1100867640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550433640 is a wasteful number, since it uses less digits than its factorization.
550433640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4586961 (or 4586957 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
The square root of 550433640 is about 23461.3222133792. The cubic root of 550433640 is about 819.5365415958.
Adding to 550433640 its reverse (46334055), we get a palindrome (596767695).
The spelling of 550433640 in words is "five hundred fifty million, four hundred thirty-three thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •