Base | Representation |
---|---|
bin | 1011111010111… |
… | …1001010100110 |
3 | 10111002021212020 |
4 | 2332233022212 |
5 | 100300004200 |
6 | 4543404010 |
7 | 1144666125 |
oct | 276571246 |
9 | 114067766 |
10 | 50000550 |
11 | 26251176 |
12 | 148b3606 |
13 | a488732 |
14 | 68d7abc |
15 | 45c9ea0 |
hex | 2faf2a6 |
50000550 has 24 divisors (see below), whose sum is σ = 124001736. Its totient is φ = 13333440.
The previous prime is 50000539. The next prime is 50000557. The reversal of 50000550 is 5500005.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
50000550 is a modest number, since divided by 550 gives 50 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50000557) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 166519 + ... + 166818.
It is an arithmetic number, because the mean of its divisors is an integer number (5166739).
Almost surely, 250000550 is an apocalyptic number.
50000550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50000550 is an abundant number, since it is smaller than the sum of its proper divisors (74001186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50000550 is a wasteful number, since it uses less digits than its factorization.
50000550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333352 (or 333347 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 15.
The square root of 50000550 is about 7071.1067026315. The cubic root of 50000550 is about 368.4045006706.
Adding to 50000550 its reverse (5500005), we get a palindrome (55500555).
The spelling of 50000550 in words is "fifty million, five hundred fifty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •