Base | Representation |
---|---|
bin | 1010100101100001… |
… | …01111010011101001 |
3 | 112200002110110221121 |
4 | 11102300233103221 |
5 | 43114432210224 |
6 | 2335544335241 |
7 | 260561513653 |
oct | 52260572351 |
9 | 15602413847 |
10 | 5683475689 |
11 | 24571a0451 |
12 | 1127474521 |
13 | 6c7633888 |
14 | 3bcb776d3 |
15 | 233e62be4 |
hex | 152c2f4e9 |
5683475689 has 4 divisors (see below), whose sum is σ = 5684056900. Its totient is φ = 5682894480.
The previous prime is 5683475671. The next prime is 5683475771. The reversal of 5683475689 is 9865743865.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1689867664 + 3993608025 = 41108^2 + 63195^2 .
It is a cyclic number.
It is not a de Polignac number, because 5683475689 - 25 = 5683475657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5683475389) 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 3 ways as a sum of consecutive naturals, for example, 275682 + ... + 295579.
It is an arithmetic number, because the mean of its divisors is an integer number (1421014225).
Almost surely, 25683475689 is an apocalyptic number.
It is an amenable number.
5683475689 is a deficient number, since it is larger than the sum of its proper divisors (581211).
5683475689 is an equidigital number, since it uses as much as digits as its factorization.
5683475689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 581210.
The product of its digits is 43545600, while the sum is 61.
The square root of 5683475689 is about 75388.8300015327. The cubic root of 5683475689 is about 1784.5881391202.
The spelling of 5683475689 in words is "five billion, six hundred eighty-three million, four hundred seventy-five thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •