Base | Representation |
---|---|
bin | 111111101101110… |
… | …001010110001001 |
3 | 2202111102221211222 |
4 | 333231301112021 |
5 | 4142123310314 |
6 | 254023331425 |
7 | 35330015546 |
oct | 7755612611 |
9 | 2674387758 |
10 | 1068963209 |
11 | 4a9446976 |
12 | 259bb0b75 |
13 | 140604b12 |
14 | a1d7dbcd |
15 | 63ca4c8e |
hex | 3fb71589 |
1068963209 has 2 divisors, whose sum is σ = 1068963210. Its totient is φ = 1068963208.
The previous prime is 1068963143. The next prime is 1068963223. The reversal of 1068963209 is 9023698601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 641507584 + 427455625 = 25328^2 + 20675^2 .
It is an emirp because it is prime and its reverse (9023698601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1068963209 - 28 = 1068962953 is a prime.
It is a super-2 number, since 2×10689632092 = 2285364684391155362, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1068963209.
It is not a weakly prime, because it can be changed into another prime (1068963509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534481604 + 534481605.
It is an arithmetic number, because the mean of its divisors is an integer number (534481605).
Almost surely, 21068963209 is an apocalyptic number.
It is an amenable number.
1068963209 is a deficient number, since it is larger than the sum of its proper divisors (1).
1068963209 is an equidigital number, since it uses as much as digits as its factorization.
1068963209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 139968, while the sum is 44.
The square root of 1068963209 is about 32695.0028138858. The cubic root of 1068963209 is about 1022.4786600919.
The spelling of 1068963209 in words is "one billion, sixty-eight million, nine hundred sixty-three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •