Base | Representation |
---|---|
bin | 1001100000001100… |
… | …10110000101101100 |
3 | 111011120012020211210 |
4 | 10300012112011230 |
5 | 40422043441004 |
6 | 2202132114420 |
7 | 240300514623 |
oct | 46006260554 |
9 | 14146166753 |
10 | 5101937004 |
11 | 2188a0186a |
12 | ba4765a10 |
13 | 633cccc48 |
14 | 3658386ba |
15 | 1ecd90089 |
hex | 13019616c |
5101937004 has 96 divisors (see below), whose sum is σ = 12694961664. Its totient is φ = 1591349760.
The previous prime is 5101936979. The next prime is 5101937047. The reversal of 5101937004 is 4007391015.
It is a super-2 number, since 2×51019370042 = 52059522385568992032, which contains 22 as substring.
It is an unprimeable number.
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, 2638422 + ... + 2640354.
It is an arithmetic number, because the mean of its divisors is an integer number (132239184).
Almost surely, 25101937004 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 5101937004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6347480832).
5101937004 is an abundant number, since it is smaller than the sum of its proper divisors (7593024660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5101937004 is a wasteful number, since it uses less digits than its factorization.
5101937004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2167 (or 2165 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 30.
The square root of 5101937004 is about 71427.8447385892. The cubic root of 5101937004 is about 1721.5185125019.
The spelling of 5101937004 in words is "five billion, one hundred one million, nine hundred thirty-seven thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •