Base | Representation |
---|---|
bin | 1001100001010101… |
… | …00011101001001100 |
3 | 111012020001112101102 |
4 | 10300222203221030 |
5 | 40432011222313 |
6 | 2203111402232 |
7 | 240444302300 |
oct | 46052435114 |
9 | 14166045342 |
10 | 5111429708 |
11 | 21932a5880 |
12 | ba7983378 |
13 | 635c74928 |
14 | 366bc9d00 |
15 | 1edb17a58 |
hex | 130aa3a4c |
5111429708 has 72 divisors (see below), whose sum is σ = 11374219584. Its totient is φ = 1987456800.
The previous prime is 5111429707. The next prime is 5111429717. The reversal of 5111429708 is 8079241115.
It is a super-2 number, since 2×51114297082 = 52253427319649930528, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5111429707) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1211723 + ... + 1215933.
It is an arithmetic number, because the mean of its divisors is an integer number (157975272).
Almost surely, 25111429708 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 5111429708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5687109792).
5111429708 is an abundant number, since it is smaller than the sum of its proper divisors (6262789876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5111429708 is a wasteful number, since it uses less digits than its factorization.
5111429708 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4803 (or 4794 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 38.
The square root of 5111429708 is about 71494.2634621828. The cubic root of 5111429708 is about 1722.5855412828.
The spelling of 5111429708 in words is "five billion, one hundred eleven million, four hundred twenty-nine thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •