Base | Representation |
---|---|
bin | 1001100100110010… |
… | …00111001110110011 |
3 | 111021020120221200021 |
4 | 10302121013032303 |
5 | 41011421130230 |
6 | 2210024504311 |
7 | 241245526624 |
oct | 46231071663 |
9 | 14236527607 |
10 | 5140411315 |
11 | 21a86a0116 |
12 | bb561b097 |
13 | 63bc81200 |
14 | 36a9b1a4b |
15 | 20143ec7a |
hex | 1326473b3 |
5140411315 has 24 divisors (see below), whose sum is σ = 6684975360. Its totient is φ = 3792881664.
The previous prime is 5140411313. The next prime is 5140411321. The reversal of 5140411315 is 5131140415.
5140411315 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5140411315 - 21 = 5140411313 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5140411315.
It is not an unprimeable number, because it can be changed into a prime (5140411313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1784046 + ... + 1786924.
It is an arithmetic number, because the mean of its divisors is an integer number (278540640).
Almost surely, 25140411315 is an apocalyptic number.
5140411315 is a deficient number, since it is larger than the sum of its proper divisors (1544564045).
5140411315 is a wasteful number, since it uses less digits than its factorization.
5140411315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5023 (or 5010 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
The square root of 5140411315 is about 71696.6618121095. The cubic root of 5140411315 is about 1725.8350716974.
The spelling of 5140411315 in words is "five billion, one hundred forty million, four hundred eleven thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •