Base | Representation |
---|---|
bin | 100000110100011… |
… | …110001011010000 |
3 | 1102101002200212120 |
4 | 200310132023100 |
5 | 2111430013000 |
6 | 130345454240 |
7 | 16434146421 |
oct | 4064361320 |
9 | 1371080776 |
10 | 550626000 |
11 | 2628a5511 |
12 | 1344a1380 |
13 | 8a0cc402 |
14 | 531b3648 |
15 | 335186a0 |
hex | 20d1e2d0 |
550626000 has 80 divisors (see below), whose sum is σ = 1775237568. Its totient is φ = 146832000.
The previous prime is 550625993. The next prime is 550626007. The reversal of 550626000 is 626055.
It is an interprime number because it is at equal distance from previous prime (550625993) and next prime (550626007).
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550626007) 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, 39886 + ... + 51885.
Almost surely, 2550626000 is an apocalyptic number.
550626000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
550626000 is an abundant number, since it is smaller than the sum of its proper divisors (1224611568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550626000 is a wasteful number, since it uses less digits than its factorization.
550626000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91797 (or 91781 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 550626000 is about 23465.4213684732. The cubic root of 550626000 is about 819.6319982667.
Subtracting from 550626000 its reverse (626055), we obtain a palindrome (549999945).
The spelling of 550626000 in words is "five hundred fifty million, six hundred twenty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •