Base | Representation |
---|---|
bin | 1001011010000000… |
… | …01111011000001000 |
3 | 111000221110211112020 |
4 | 10231000033120020 |
5 | 40320300130000 |
6 | 2153035044440 |
7 | 236100222435 |
oct | 45500173010 |
9 | 14027424466 |
10 | 5050005000 |
11 | 2161661557 |
12 | b8b2a0720 |
13 | 626319351 |
14 | 35c99ab8c |
15 | 1e8532ba0 |
hex | 12d00f608 |
5050005000 has 80 divisors (see below), whose sum is σ = 15776262480. Its totient is φ = 1346664000.
The previous prime is 5050004983. The next prime is 5050005007. The reversal of 5050005000 is 5000505.
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.
It is not an unprimeable number, because it can be changed into a prime (5050005007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 153334 + ... + 183333.
It is an arithmetic number, because the mean of its divisors is an integer number (197203281).
Almost surely, 25050005000 is an apocalyptic number.
5050005000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5050005000 is an abundant number, since it is smaller than the sum of its proper divisors (10726257480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5050005000 is a wasteful number, since it uses less digits than its factorization.
5050005000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 336696 (or 336677 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 15.
The square root of 5050005000 is about 71063.3871976280. The cubic root of 5050005000 is about 1715.6575378449.
Adding to 5050005000 its reverse (5000505), we get a palindrome (5055005505).
The spelling of 5050005000 in words is "five billion, fifty million, five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •