Base | Representation |
---|---|
bin | 1010100010100100… |
… | …10000110100101001 |
3 | 112121100212012211112 |
4 | 11101102100310221 |
5 | 43042112144124 |
6 | 2333301440105 |
7 | 260141143502 |
oct | 52122206451 |
9 | 15540765745 |
10 | 5658709289 |
11 | 2444215052 |
12 | 111b110035 |
13 | 6c2471abc |
14 | 3b976bba9 |
15 | 231bbe90e |
hex | 151490d29 |
5658709289 has 8 divisors (see below), whose sum is σ = 5668773000. Its totient is φ = 5648656896.
The previous prime is 5658709271. The next prime is 5658709319. The reversal of 5658709289 is 9829078565.
It can be written as a sum of positive squares in 4 ways, for example, as 182709289 + 5476000000 = 13517^2 + 74000^2 .
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 5658709289 - 28 = 5658709033 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5658789289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2057087 + ... + 2059835.
It is an arithmetic number, because the mean of its divisors is an integer number (708596625).
Almost surely, 25658709289 is an apocalyptic number.
It is an amenable number.
5658709289 is a deficient number, since it is larger than the sum of its proper divisors (10063711).
5658709289 is a wasteful number, since it uses less digits than its factorization.
5658709289 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5659.
The product of its (nonzero) digits is 10886400, while the sum is 59.
The square root of 5658709289 is about 75224.3929121399. The cubic root of 5658709289 is about 1781.9921819384.
The spelling of 5658709289 in words is "five billion, six hundred fifty-eight million, seven hundred nine thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •