Base | Representation |
---|---|
bin | 1001111000101111… |
… | …10110000100011111 |
3 | 111200220122202210112 |
4 | 10330113312010133 |
5 | 41332302213124 |
6 | 2234405400235 |
7 | 245350663241 |
oct | 47427660437 |
9 | 14626582715 |
10 | 5307851039 |
11 | 2284164057 |
12 | 104170907b |
13 | 66787807a |
14 | 384d1a091 |
15 | 210eb690e |
hex | 13c5f611f |
5307851039 has 4 divisors (see below), whose sum is σ = 5587211640. Its totient is φ = 5028490440.
The previous prime is 5307851033. The next prime is 5307851051. The reversal of 5307851039 is 9301587035.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5307851039 - 24 = 5307851023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5307850987 and 5307851005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5307851033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 139680272 + ... + 139680309.
It is an arithmetic number, because the mean of its divisors is an integer number (1396802910).
Almost surely, 25307851039 is an apocalyptic number.
5307851039 is a deficient number, since it is larger than the sum of its proper divisors (279360601).
5307851039 is a wasteful number, since it uses less digits than its factorization.
5307851039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279360600.
The product of its (nonzero) digits is 113400, while the sum is 41.
The square root of 5307851039 is about 72855.0000960813. Note that the first 4 decimals coincide. The cubic root of 5307851039 is about 1744.3738816593.
The spelling of 5307851039 in words is "five billion, three hundred seven million, eight hundred fifty-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •