Base | Representation |
---|---|
bin | 1001001000000111… |
… | …11000100001001000 |
3 | 110122111011000100012 |
4 | 10210003320201020 |
5 | 40013342340000 |
6 | 2130115131052 |
7 | 232266005150 |
oct | 44403704110 |
9 | 13574130305 |
10 | 4899965000 |
11 | 20949a2257 |
12 | b48ba3a88 |
13 | 601205198 |
14 | 346aa1760 |
15 | 1da296735 |
hex | 1240f8848 |
4899965000 has 80 divisors (see below), whose sum is σ = 13120800000. Its totient is φ = 1679976000.
The previous prime is 4899964987. The next prime is 4899965017. The reversal of 4899965000 is 5699984.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a self number, because there is not a number n which added to its sum of digits gives 4899965000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 35000 + ... + 104999.
It is an arithmetic number, because the mean of its divisors is an integer number (164010000).
Almost surely, 24899965000 is an apocalyptic number.
4899965000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4899965000 is an abundant number, since it is smaller than the sum of its proper divisors (8220835000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4899965000 is a wasteful number, since it uses less digits than its factorization.
4899965000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140032 (or 140013 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 50.
The square root of 4899965000 is about 69999.7499995536. The cubic root of 4899965000 is about 1698.4952081863.
The spelling of 4899965000 in words is "four billion, eight hundred ninety-nine million, nine hundred sixty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •