Base | Representation |
---|---|
bin | 1001100000000111… |
… | …00101100000101100 |
3 | 111011111211111201020 |
4 | 10300003211200230 |
5 | 40421402314430 |
6 | 2202104414140 |
7 | 240261413160 |
oct | 46003454054 |
9 | 14144744636 |
10 | 5101213740 |
11 | 2188558427 |
12 | ba4477350 |
13 | 633b0898c |
14 | 3656caca0 |
15 | 1ecc9ab10 |
hex | 1300e582c |
5101213740 has 96 divisors (see below), whose sum is σ = 16366371840. Its totient is φ = 1162957056.
The previous prime is 5101213739. The next prime is 5101213829. The reversal of 5101213740 is 473121015.
It is a self number, because there is not a number n which added to its sum of digits gives 5101213740.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 147769 + ... + 178991.
It is an arithmetic number, because the mean of its divisors is an integer number (170483040).
Almost surely, 25101213740 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 5101213740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8183185920).
5101213740 is an abundant number, since it is smaller than the sum of its proper divisors (11265158100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5101213740 is a wasteful number, since it uses less digits than its factorization.
5101213740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31631 (or 31629 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 5101213740 is about 71422.7816596357. The cubic root of 5101213740 is about 1721.4371596610.
Adding to 5101213740 its reverse (473121015), we get a palindrome (5574334755).
The spelling of 5101213740 in words is "five billion, one hundred one million, two hundred thirteen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •