Base | Representation |
---|---|
bin | 1011111011110… |
… | …0100101001100 |
3 | 10111012002020102 |
4 | 2332330211030 |
5 | 100303234000 |
6 | 4544510232 |
7 | 1145315255 |
oct | 276744514 |
9 | 114162212 |
10 | 50055500 |
11 | 26289490 |
12 | 1491b378 |
13 | a4a7751 |
14 | 690db2c |
15 | 45db3d5 |
hex | 2fbc94c |
50055500 has 96 divisors (see below), whose sum is σ = 125798400. Its totient is φ = 17208000.
The previous prime is 50055457. The next prime is 50055503. The reversal of 50055500 is 555005.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50055503) 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, 104261 + ... + 104739.
It is an arithmetic number, because the mean of its divisors is an integer number (1310400).
Almost surely, 250055500 is an apocalyptic number.
50055500 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 50055500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62899200).
50055500 is an abundant number, since it is smaller than the sum of its proper divisors (75742900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50055500 is a wasteful number, since it uses less digits than its factorization.
50055500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528 (or 516 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 20.
The square root of 50055500 is about 7074.9911660722. The cubic root of 50055500 is about 368.5394086262.
The spelling of 50055500 in words is "fifty million, fifty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •