Base | Representation |
---|---|
bin | 1100000001111… |
… | …0001000001010 |
3 | 10111221101022120 |
4 | 3000132020022 |
5 | 100404030200 |
6 | 5001232110 |
7 | 1151601162 |
oct | 300361012 |
9 | 114841276 |
10 | 50455050 |
11 | 26531698 |
12 | 14a92636 |
13 | a5b7579 |
14 | 69b55a2 |
15 | 46699a0 |
hex | 301e20a |
50455050 has 48 divisors (see below), whose sum is σ = 128524512. Its totient is φ = 13089600.
The previous prime is 50455019. The next prime is 50455081. The reversal of 50455050 is 5055405.
It is an interprime number because it is at equal distance from previous prime (50455019) and next prime (50455081).
It is a self number, because there is not a number n which added to its sum of digits gives 50455050.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1005 + ... + 10095.
It is an arithmetic number, because the mean of its divisors is an integer number (2677594).
Almost surely, 250455050 is an apocalyptic number.
50455050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 50455050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64262256).
50455050 is an abundant number, since it is smaller than the sum of its proper divisors (78069462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50455050 is a wasteful number, since it uses less digits than its factorization.
50455050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9143 (or 9138 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 24.
The square root of 50455050 is about 7103.1718267264. The cubic root of 50455050 is about 369.5173887956.
The spelling of 50455050 in words is "fifty million, four hundred fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •