Base | Representation |
---|---|
bin | 1001100010011001… |
… | …10010111010001010 |
3 | 111012211221112100110 |
4 | 10301030302322022 |
5 | 40441310431010 |
6 | 2204032015150 |
7 | 240613503561 |
oct | 46114627212 |
9 | 14184845313 |
10 | 5120405130 |
11 | 2198376185 |
12 | baa9914b6 |
13 | 637a98029 |
14 | 368084bd8 |
15 | 1ee7dc120 |
hex | 131332e8a |
5120405130 has 128 divisors (see below), whose sum is σ = 13419012096. Its totient is φ = 1246784000.
The previous prime is 5120405063. The next prime is 5120405131. The reversal of 5120405130 is 315040215.
It is a junction number, because it is equal to n+sod(n) for n = 5120405097 and 5120405106.
It is not an unprimeable number, because it can be changed into a prime (5120405131) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1327705 + ... + 1331555.
It is an arithmetic number, because the mean of its divisors is an integer number (104836032).
Almost surely, 25120405130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5120405130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6709506048).
5120405130 is an abundant number, since it is smaller than the sum of its proper divisors (8298606966).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5120405130 is a wasteful number, since it uses less digits than its factorization.
5120405130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3972.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 5120405130 is about 71557.0061559314. The cubic root of 5120405130 is about 1723.5932105206.
Adding to 5120405130 its reverse (315040215), we get a palindrome (5435445345).
The spelling of 5120405130 in words is "five billion, one hundred twenty million, four hundred five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •