Base | Representation |
---|---|
bin | 1001100100110000… |
… | …00000001111001000 |
3 | 111021020001011210002 |
4 | 10302120000033020 |
5 | 41011332324040 |
6 | 2210014342132 |
7 | 241243206053 |
oct | 46230001710 |
9 | 14236034702 |
10 | 5140120520 |
11 | 21a8511697 |
12 | bb54ba948 |
13 | 63bbaba42 |
14 | 36a937a9a |
15 | 2013d3a15 |
hex | 1326003c8 |
5140120520 has 16 divisors (see below), whose sum is σ = 11565271260. Its totient is φ = 2056048192.
The previous prime is 5140120519. The next prime is 5140120553. The reversal of 5140120520 is 250210415.
It can be written as a sum of positive squares in 2 ways, for example, as 5129137924 + 10982596 = 71618^2 + 3314^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 5140120492 and 5140120501.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 64251467 + ... + 64251546.
Almost surely, 25140120520 is an apocalyptic number.
It is an amenable number.
5140120520 is an abundant number, since it is smaller than the sum of its proper divisors (6425150740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5140120520 is a wasteful number, since it uses less digits than its factorization.
5140120520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128503024 (or 128503020 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 5140120520 is about 71694.6338298760. The cubic root of 5140120520 is about 1725.8025273708.
Adding to 5140120520 its reverse (250210415), we get a palindrome (5390330935).
The spelling of 5140120520 in words is "five billion, one hundred forty million, one hundred twenty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •