Base | Representation |
---|---|
bin | 1001010111100000… |
… | …01000011010001100 |
3 | 110222110221220212020 |
4 | 10223300020122030 |
5 | 40244411124230 |
6 | 2151005010140 |
7 | 235423556661 |
oct | 45360103214 |
9 | 13873856766 |
10 | 5029004940 |
11 | 2150818933 |
12 | b84253950 |
13 | 621b7598b |
14 | 359c91a68 |
15 | 1e6785810 |
hex | 12bc0868c |
5029004940 has 96 divisors (see below), whose sum is σ = 15046637760. Its totient is φ = 1250574336.
The previous prime is 5029004909. The next prime is 5029004941. The reversal of 5029004940 is 494009205.
It is not an unprimeable number, because it can be changed into a prime (5029004941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88564 + ... + 133796.
It is an arithmetic number, because the mean of its divisors is an integer number (156735810).
Almost surely, 25029004940 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5029004940, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7523318880).
5029004940 is an abundant number, since it is smaller than the sum of its proper divisors (10017632820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5029004940 is a wasteful number, since it uses less digits than its factorization.
5029004940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45371 (or 45369 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 5029004940 is about 70915.4774361704. The cubic root of 5029004940 is about 1713.2760901639.
The spelling of 5029004940 in words is "five billion, twenty-nine million, four thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •