Base | Representation |
---|---|
bin | 101100100110… |
… | …001111100101 |
3 | 210222222000022 |
4 | 230212033211 |
5 | 10443102411 |
6 | 1054324525 |
7 | 201241331 |
oct | 54461745 |
9 | 23888008 |
10 | 11690981 |
11 | 6665675 |
12 | 3ab9745 |
13 | 2564453 |
14 | 17a47c1 |
15 | 105dedb |
hex | b263e5 |
11690981 has 2 divisors, whose sum is σ = 11690982. Its totient is φ = 11690980.
The previous prime is 11690977. The next prime is 11690983. The reversal of 11690981 is 18909611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6806881 + 4884100 = 2609^2 + 2210^2 .
It is a cyclic number.
It is not a de Polignac number, because 11690981 - 22 = 11690977 is a prime.
It is a super-2 number, since 2×116909812 = 273358073484722, which contains 22 as substring.
Together with 11690983, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11690983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5845490 + 5845491.
It is an arithmetic number, because the mean of its divisors is an integer number (5845491).
Almost surely, 211690981 is an apocalyptic number.
It is an amenable number.
11690981 is a deficient number, since it is larger than the sum of its proper divisors (1).
11690981 is an equidigital number, since it uses as much as digits as its factorization.
11690981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 35.
The square root of 11690981 is about 3419.2076567532. The cubic root of 11690981 is about 226.9605202159.
The spelling of 11690981 in words is "eleven million, six hundred ninety thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •