Base | Representation |
---|---|
bin | 1001100001110001… |
… | …01011011000101111 |
3 | 111012111000121012120 |
4 | 10300320223120233 |
5 | 40433433201224 |
6 | 2203323004023 |
7 | 240520620435 |
oct | 46070533057 |
9 | 14174017176 |
10 | 5115131439 |
11 | 21953a3a60 |
12 | ba9069613 |
13 | 63696c7c2 |
14 | 3674b0d55 |
15 | 1ee0e9779 |
hex | 130e2b62f |
5115131439 has 8 divisors (see below), whose sum is σ = 7440191232. Its totient is φ = 3100079640.
The previous prime is 5115131381. The next prime is 5115131467. The reversal of 5115131439 is 9341315115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5115131439 - 27 = 5115131311 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 155003983 = 5115131439 / (5 + 1 + 1 + 5 + 1 + 3 + 1 + 4 + 3 + 9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5115131039) 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 7 ways as a sum of consecutive naturals, for example, 77501959 + ... + 77502024.
It is an arithmetic number, because the mean of its divisors is an integer number (930023904).
Almost surely, 25115131439 is an apocalyptic number.
5115131439 is a deficient number, since it is larger than the sum of its proper divisors (2325059793).
5115131439 is a wasteful number, since it uses less digits than its factorization.
5115131439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155003997.
The product of its digits is 8100, while the sum is 33.
The square root of 5115131439 is about 71520.1470845803. The cubic root of 5115131439 is about 1723.0012768642.
The spelling of 5115131439 in words is "five billion, one hundred fifteen million, one hundred thirty-one thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •