Base | Representation |
---|---|
bin | 101010001110… |
… | …001010011101 |
3 | 202211022112012 |
4 | 222032022131 |
5 | 10313134221 |
6 | 1033121005 |
7 | 163035254 |
oct | 52161235 |
9 | 22738465 |
10 | 11068061 |
11 | 627a664 |
12 | 3859165 |
13 | 23a6a64 |
14 | 168179b |
15 | e8965b |
hex | a8e29d |
11068061 has 2 divisors, whose sum is σ = 11068062. Its totient is φ = 11068060.
The previous prime is 11068039. The next prime is 11068067. The reversal of 11068061 is 16086011.
It is a happy number.
11068061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7896100 + 3171961 = 2810^2 + 1781^2 .
It is an emirp because it is prime and its reverse (16086011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11068061 - 26 = 11067997 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is equal to p730715 and since 11068061 and 730715 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11068067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5534030 + 5534031.
It is an arithmetic number, because the mean of its divisors is an integer number (5534031).
Almost surely, 211068061 is an apocalyptic number.
It is an amenable number.
11068061 is a deficient number, since it is larger than the sum of its proper divisors (1).
11068061 is an equidigital number, since it uses as much as digits as its factorization.
11068061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 23.
The square root of 11068061 is about 3326.8695495916. The cubic root of 11068061 is about 222.8557520615.
The spelling of 11068061 in words is "eleven million, sixty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •