Base | Representation |
---|---|
bin | 1010100101101101… |
… | …00110100011100101 |
3 | 112200012100120100021 |
4 | 11102312212203211 |
5 | 43120330401314 |
6 | 2340041315141 |
7 | 260610545035 |
oct | 52266464345 |
9 | 15605316307 |
10 | 5685012709 |
11 | 2458050212 |
12 | 1127a95ab1 |
13 | 6c7a5135c |
14 | 3bd0578c5 |
15 | 234168324 |
hex | 152da68e5 |
5685012709 has 4 divisors (see below), whose sum is σ = 5881047660. Its totient is φ = 5488977760.
The previous prime is 5685012701. The next prime is 5685012737. The reversal of 5685012709 is 9072105865.
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 4141308609 + 1543704100 = 64353^2 + 39290^2 .
It is a cyclic number.
It is not a de Polignac number, because 5685012709 - 23 = 5685012701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5685012701) 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, 98017432 + ... + 98017489.
It is an arithmetic number, because the mean of its divisors is an integer number (1470261915).
Almost surely, 25685012709 is an apocalyptic number.
It is an amenable number.
5685012709 is a deficient number, since it is larger than the sum of its proper divisors (196034951).
5685012709 is a wasteful number, since it uses less digits than its factorization.
5685012709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196034950.
The product of its (nonzero) digits is 151200, while the sum is 43.
The square root of 5685012709 is about 75399.0232629044. The cubic root of 5685012709 is about 1784.7489972866.
The spelling of 5685012709 in words is "five billion, six hundred eighty-five million, twelve thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •