Base | Representation |
---|---|
bin | 100000110100000… |
… | …000001001011000 |
3 | 1102100212110011000 |
4 | 200310000021120 |
5 | 2111412044000 |
6 | 130343105000 |
7 | 16433125005 |
oct | 4064001130 |
9 | 1370773130 |
10 | 550503000 |
11 | 262821063 |
12 | 134442160 |
13 | 8a088428 |
14 | 531808ac |
15 | 334e2000 |
hex | 20d00258 |
550503000 has 128 divisors (see below), whose sum is σ = 1908504000. Its totient is φ = 146793600.
The previous prime is 550502987. The next prime is 550503007. The reversal of 550503000 is 305055.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550503007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16806 + ... + 37194.
Almost surely, 2550503000 is an apocalyptic number.
550503000 is a gapful number since it is divisible by the number (50) 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 550503000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (954252000).
550503000 is an abundant number, since it is smaller than the sum of its proper divisors (1358001000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550503000 is a wasteful number, since it uses less digits than its factorization.
550503000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20419 (or 20399 counting only the distinct ones).
The product of its (nonzero) digits is 375, while the sum is 18.
The square root of 550503000 is about 23462.8003443749. The cubic root of 550503000 is about 819.5709633456.
Adding to 550503000 its reverse (305055), we get a palindrome (550808055).
The spelling of 550503000 in words is "five hundred fifty million, five hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •