Base | Representation |
---|---|
bin | 100000100111110100001 |
3 | 2000022100011 |
4 | 10010332201 |
5 | 233201321 |
6 | 34524521 |
7 | 12041335 |
oct | 4047641 |
9 | 2008304 |
10 | 1068961 |
11 | 670143 |
12 | 436741 |
13 | 2b572a |
14 | 1db7c5 |
15 | 161ae1 |
hex | 104fa1 |
1068961 has 4 divisors (see below), whose sum is σ = 1071252. Its totient is φ = 1066672.
The previous prime is 1068941. The next prime is 1068989. The reversal of 1068961 is 1698601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1698601 = 617 ⋅2753.
It can be written as a sum of positive squares in 2 ways, for example, as 118336 + 950625 = 344^2 + 975^2 .
It is a cyclic number.
It is not a de Polignac number, because 1068961 - 211 = 1066913 is a prime.
It is a super-2 number, since 2×10689612 = 2285355239042, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1068901) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 166 + ... + 1471.
It is an arithmetic number, because the mean of its divisors is an integer number (267813).
21068961 is an apocalyptic number.
It is an amenable number.
1068961 is a deficient number, since it is larger than the sum of its proper divisors (2291).
1068961 is an equidigital number, since it uses as much as digits as its factorization.
1068961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2290.
The product of its (nonzero) digits is 2592, while the sum is 31.
The square root of 1068961 is about 1033.9057016962. The cubic root of 1068961 is about 102.2477955778.
The spelling of 1068961 in words is "one million, sixty-eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •