Base | Representation |
---|---|
bin | 100000110010000… |
… | …111000011011000 |
3 | 1102022221020202122 |
4 | 200302013003120 |
5 | 2111300211000 |
6 | 130324320412 |
7 | 16425660644 |
oct | 4062070330 |
9 | 1368836678 |
10 | 550007000 |
11 | 262512444 |
12 | 134243108 |
13 | 89c4373a |
14 | 53091c24 |
15 | 33445085 |
hex | 20c870d8 |
550007000 has 32 divisors (see below), whose sum is σ = 1287018720. Its totient is φ = 220002400.
The previous prime is 550006993. The next prime is 550007009. The reversal of 550007000 is 700055.
It is a self number, because there is not a number n which added to its sum of digits gives 550007000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550007009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 274004 + ... + 276003.
It is an arithmetic number, because the mean of its divisors is an integer number (40219335).
Almost surely, 2550007000 is an apocalyptic number.
550007000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
550007000 is an abundant number, since it is smaller than the sum of its proper divisors (737011720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550007000 is a wasteful number, since it uses less digits than its factorization.
550007000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550028 (or 550014 counting only the distinct ones).
The product of its (nonzero) digits is 175, while the sum is 17.
The square root of 550007000 is about 23452.2280391437. The cubic root of 550007000 is about 819.3247464943.
Adding to 550007000 its reverse (700055), we get a palindrome (550707055).
The spelling of 550007000 in words is "five hundred fifty million, seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •