Base | Representation |
---|---|
bin | 1001100011101011… |
… | …01001110111111110 |
3 | 111020121002200221110 |
4 | 10301311221313332 |
5 | 41002031203110 |
6 | 2205053342450 |
7 | 241103523645 |
oct | 46165516776 |
9 | 14217080843 |
10 | 5131116030 |
11 | 21a3421467 |
12 | bb2497a26 |
13 | 63a078341 |
14 | 36967235c |
15 | 200705a20 |
hex | 131d69dfe |
5131116030 has 48 divisors (see below), whose sum is σ = 12551621040. Its totient is φ = 1342458624.
The previous prime is 5131115989. The next prime is 5131116043. The reversal of 5131116030 is 306111315.
It is a junction number, because it is equal to n+sod(n) for n = 5131115988 and 5131116006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53826 + ... + 114714.
It is an arithmetic number, because the mean of its divisors is an integer number (261492105).
Almost surely, 25131116030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5131116030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6275810520).
5131116030 is an abundant number, since it is smaller than the sum of its proper divisors (7420505010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5131116030 is a wasteful number, since it uses less digits than its factorization.
5131116030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61005 (or 60952 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 21.
The square root of 5131116030 is about 71631.8087863206. The cubic root of 5131116030 is about 1724.7941817030.
Adding to 5131116030 its reverse (306111315), we get a palindrome (5437227345).
The spelling of 5131116030 in words is "five billion, one hundred thirty-one million, one hundred sixteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •