Base | Representation |
---|---|
bin | 111111101010001… |
… | …101100001000001 |
3 | 2202102200112202022 |
4 | 333222031201001 |
5 | 4141403430032 |
6 | 253551331225 |
7 | 35316051065 |
oct | 7752154101 |
9 | 2672615668 |
10 | 1068030017 |
11 | 4a896983a |
12 | 259820b15 |
13 | 140369132 |
14 | a1bb9aa5 |
15 | 63b6d512 |
hex | 3fa8d841 |
1068030017 has 2 divisors, whose sum is σ = 1068030018. Its totient is φ = 1068030016.
The previous prime is 1068030013. The next prime is 1068030059. The reversal of 1068030017 is 7100308601.
1068030017 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 797723536 + 270306481 = 28244^2 + 16441^2 .
It is a cyclic number.
It is not a de Polignac number, because 1068030017 - 22 = 1068030013 is a prime.
It is a super-2 number, since 2×10680300172 = 2281376234426040578, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1068030013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534015008 + 534015009.
It is an arithmetic number, because the mean of its divisors is an integer number (534015009).
Almost surely, 21068030017 is an apocalyptic number.
It is an amenable number.
1068030017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1068030017 is an equidigital number, since it uses as much as digits as its factorization.
1068030017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
The square root of 1068030017 is about 32680.7285261513. The cubic root of 1068030017 is about 1022.1810362848.
Adding to 1068030017 its reverse (7100308601), we get a palindrome (8168338618).
The spelling of 1068030017 in words is "one billion, sixty-eight million, thirty thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •