Base | Representation |
---|---|
bin | 1001100001110010… |
… | …10101101001010011 |
3 | 111012111100101122101 |
4 | 10300321111221103 |
5 | 40434004221111 |
6 | 2203330421231 |
7 | 240522241201 |
oct | 46071255123 |
9 | 14174311571 |
10 | 5115304531 |
11 | 2195502007 |
12 | ba9131817 |
13 | 636a0051c |
14 | 367518071 |
15 | 1ee130bc1 |
hex | 130e55a53 |
5115304531 has 8 divisors (see below), whose sum is σ = 5153495984. Its totient is φ = 5077222560.
The previous prime is 5115304499. The next prime is 5115304541. The reversal of 5115304531 is 1354035115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5115304531 - 25 = 5115304499 is a prime.
It is a super-2 number, since 2×51153045312 = 52332680889738259922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5115304531.
It is not an unprimeable number, because it can be changed into a prime (5115304541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67645 + ... + 121681.
It is an arithmetic number, because the mean of its divisors is an integer number (644186998).
Almost surely, 25115304531 is an apocalyptic number.
5115304531 is a deficient number, since it is larger than the sum of its proper divisors (38191453).
5115304531 is a wasteful number, since it uses less digits than its factorization.
5115304531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54741.
The product of its (nonzero) digits is 4500, while the sum is 28.
The square root of 5115304531 is about 71521.3571669330. The cubic root of 5115304531 is about 1723.0207116449.
Adding to 5115304531 its reverse (1354035115), we get a palindrome (6469339646).
The spelling of 5115304531 in words is "five billion, one hundred fifteen million, three hundred four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •