Base | Representation |
---|---|
bin | 1001100000001011… |
… | …00000001010111000 |
3 | 111011112210000220002 |
4 | 10300011200022320 |
5 | 40422014404102 |
6 | 2202123252132 |
7 | 240265605011 |
oct | 46005401270 |
9 | 14145700802 |
10 | 5101716152 |
11 | 2188870945 |
12 | ba467a048 |
13 | 633c53570 |
14 | 3657bc008 |
15 | 1ecd49902 |
hex | 1301602b8 |
5101716152 has 32 divisors (see below), whose sum is σ = 10334731680. Its totient is φ = 2347052160.
The previous prime is 5101716149. The next prime is 5101716157. The reversal of 5101716152 is 2516171015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5101716157) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 46523 + ... + 111210.
It is an arithmetic number, because the mean of its divisors is an integer number (322960365).
Almost surely, 25101716152 is an apocalyptic number.
5101716152 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5101716152 is an abundant number, since it is smaller than the sum of its proper divisors (5233015528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5101716152 is a wasteful number, since it uses less digits than its factorization.
5101716152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158063 (or 158059 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 29.
The square root of 5101716152 is about 71426.2987421300. The cubic root of 5101716152 is about 1721.4936718520.
Adding to 5101716152 its reverse (2516171015), we get a palindrome (7617887167).
The spelling of 5101716152 in words is "five billion, one hundred one million, seven hundred sixteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •