Base | Representation |
---|---|
bin | 111111101101101… |
… | …001111010110101 |
3 | 2202111101102010022 |
4 | 333231221322311 |
5 | 4142121322124 |
6 | 254022534525 |
7 | 35326531061 |
oct | 7755517265 |
9 | 2674342108 |
10 | 1068932789 |
11 | 4a9426031 |
12 | 259b97445 |
13 | 1405c4012 |
14 | a1d72aa1 |
15 | 63c9ac5e |
hex | 3fb69eb5 |
1068932789 has 2 divisors, whose sum is σ = 1068932790. Its totient is φ = 1068932788.
The previous prime is 1068932741. The next prime is 1068932791. The reversal of 1068932789 is 9872398601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1034908900 + 34023889 = 32170^2 + 5833^2 .
It is a cyclic number.
It is not a de Polignac number, because 1068932789 - 228 = 800497333 is a prime.
It is a super-2 number, since 2×10689327892 = 2285234614798637042, which contains 22 as substring.
Together with 1068932791, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1068932789.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1068931789) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534466394 + 534466395.
It is an arithmetic number, because the mean of its divisors is an integer number (534466395).
Almost surely, 21068932789 is an apocalyptic number.
It is an amenable number.
1068932789 is a deficient number, since it is larger than the sum of its proper divisors (1).
1068932789 is an equidigital number, since it uses as much as digits as its factorization.
1068932789 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 53.
The square root of 1068932789 is about 32694.5376018686. The cubic root of 1068932789 is about 1022.4689609443.
The spelling of 1068932789 in words is "one billion, sixty-eight million, nine hundred thirty-two thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •