Base | Representation |
---|---|
bin | 111111101010001… |
… | …101101000110111 |
3 | 2202102200120102220 |
4 | 333222031220313 |
5 | 4141403434034 |
6 | 253551333423 |
7 | 35316052413 |
oct | 7752155067 |
9 | 2672616386 |
10 | 1068030519 |
11 | 4a896a156 |
12 | 259821273 |
13 | 14036942a |
14 | a1bb9d43 |
15 | 63b6d749 |
hex | 3fa8da37 |
1068030519 has 4 divisors (see below), whose sum is σ = 1424040696. Its totient is φ = 712020344.
The previous prime is 1068030511. The next prime is 1068030539. The reversal of 1068030519 is 9150308601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1068030519 - 23 = 1068030511 is a prime.
It is a super-2 number, since 2×10680305192 = 2281378379030818722, 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 1068030519.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1068030511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 178005084 + ... + 178005089.
It is an arithmetic number, because the mean of its divisors is an integer number (356010174).
Almost surely, 21068030519 is an apocalyptic number.
1068030519 is a deficient number, since it is larger than the sum of its proper divisors (356010177).
1068030519 is an equidigital number, since it uses as much as digits as its factorization.
1068030519 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356010176.
The product of its (nonzero) digits is 6480, while the sum is 33.
The square root of 1068030519 is about 32680.7362065177. The cubic root of 1068030519 is about 1022.1811964347.
The spelling of 1068030519 in words is "one billion, sixty-eight million, thirty thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •