Base | Representation |
---|---|
bin | 1001100111001101… |
… | …01101001100100100 |
3 | 111022122212100201120 |
4 | 10303212231030210 |
5 | 41032123030113 |
6 | 2212032453540 |
7 | 241613444634 |
oct | 46346551444 |
9 | 14278770646 |
10 | 5160751908 |
11 | 2209123324 |
12 | 10003aa2b0 |
13 | 643253670 |
14 | 36d5886c4 |
15 | 20310ba23 |
hex | 1339ad324 |
5160751908 has 96 divisors (see below), whose sum is σ = 13426947072. Its totient is φ = 1532044800.
The previous prime is 5160751907. The next prime is 5160751913. The reversal of 5160751908 is 8091570615.
It is a self number, because there is not a number n which added to its sum of digits gives 5160751908.
It is not an unprimeable number, because it can be changed into a prime (5160751901) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1802398 + ... + 1805258.
It is an arithmetic number, because the mean of its divisors is an integer number (139864032).
Almost surely, 25160751908 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 5160751908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6713473536).
5160751908 is an abundant number, since it is smaller than the sum of its proper divisors (8266195164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5160751908 is a wasteful number, since it uses less digits than its factorization.
5160751908 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3285 (or 3283 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 42.
The square root of 5160751908 is about 71838.3735060866. The cubic root of 5160751908 is about 1728.1084505730.
The spelling of 5160751908 in words is "five billion, one hundred sixty million, seven hundred fifty-one thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •