Base | Representation |
---|---|
bin | 100000100110100001001 |
3 | 2000021102120 |
4 | 10010310021 |
5 | 233141142 |
6 | 34521453 |
7 | 12036366 |
oct | 4046411 |
9 | 2007376 |
10 | 1068297 |
11 | 66a69a |
12 | 436289 |
13 | 2b5339 |
14 | 1db46d |
15 | 1617ec |
hex | 104d09 |
1068297 has 8 divisors (see below), whose sum is σ = 1508256. Its totient is φ = 670272.
The previous prime is 1068271. The next prime is 1068307. The reversal of 1068297 is 7928601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1068297 - 26 = 1068233 is a prime.
It is a super-2 number, since 2×10682972 = 2282516960418, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1068217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10423 + ... + 10524.
It is an arithmetic number, because the mean of its divisors is an integer number (188532).
21068297 is an apocalyptic number.
1068297 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1068297 is a deficient number, since it is larger than the sum of its proper divisors (439959).
1068297 is a wasteful number, since it uses less digits than its factorization.
1068297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20967.
The product of its (nonzero) digits is 6048, while the sum is 33.
The square root of 1068297 is about 1033.5845393581. The cubic root of 1068297 is about 102.2266203124.
The spelling of 1068297 in words is "one million, sixty-eight thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •