Base | Representation |
---|---|
bin | 1010100101011110… |
… | …00111001001001111 |
3 | 112200001122210200202 |
4 | 11102233013021033 |
5 | 43114330032124 |
6 | 2335531244115 |
7 | 260555056043 |
oct | 52257071117 |
9 | 15601583622 |
10 | 5683049039 |
11 | 2456a29948 |
12 | 11272a963b |
13 | 6c7514615 |
14 | 3bcaa6023 |
15 | 233dcb5ae |
hex | 152bc724f |
5683049039 has 12 divisors (see below), whose sum is σ = 5830921824. Its totient is φ = 5536370112.
The previous prime is 5683049023. The next prime is 5683049063. The reversal of 5683049039 is 9309403865.
It is not a de Polignac number, because 5683049039 - 24 = 5683049023 is a prime.
It is a hoax number, since the sum of its digits (47) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5683048984 and 5683049002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5683049639) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9487262 + ... + 9487860.
It is an arithmetic number, because the mean of its divisors is an integer number (485910152).
Almost surely, 25683049039 is an apocalyptic number.
5683049039 is a deficient number, since it is larger than the sum of its proper divisors (147872785).
5683049039 is an frugal number, since it uses more digits than its factorization.
5683049039 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1582 (or 983 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 47.
The square root of 5683049039 is about 75386.0002851988. Note that the first 3 decimals coincide. The cubic root of 5683049039 is about 1784.5434825506.
The spelling of 5683049039 in words is "five billion, six hundred eighty-three million, forty-nine thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •