Base | Representation |
---|---|
bin | 101001101111… |
… | …000100001001 |
3 | 202120211210102 |
4 | 221233010021 |
5 | 10300100211 |
6 | 1030255145 |
7 | 161665013 |
oct | 51570411 |
9 | 22524712 |
10 | 10940681 |
11 | 61a2994 |
12 | 37b74b5 |
13 | 2360a9b |
14 | 164b1b3 |
15 | e61a3b |
hex | a6f109 |
10940681 has 4 divisors (see below), whose sum is σ = 11063700. Its totient is φ = 10817664.
The previous prime is 10940651. The next prime is 10940687. The reversal of 10940681 is 18604901.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 18604901 = 7 ⋅2657843.
It can be written as a sum of positive squares in 2 ways, for example, as 1175056 + 9765625 = 1084^2 + 3125^2 .
It is a cyclic number.
It is not a de Polignac number, because 10940681 - 210 = 10939657 is a prime.
It is a super-2 number, since 2×109406812 = 239397001487522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10940687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61376 + ... + 61553.
It is an arithmetic number, because the mean of its divisors is an integer number (2765925).
Almost surely, 210940681 is an apocalyptic number.
It is an amenable number.
10940681 is a deficient number, since it is larger than the sum of its proper divisors (123019).
10940681 is an equidigital number, since it uses as much as digits as its factorization.
10940681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123018.
The product of its (nonzero) digits is 1728, while the sum is 29.
The square root of 10940681 is about 3307.6700258641. The cubic root of 10940681 is about 221.9975177603.
The spelling of 10940681 in words is "ten million, nine hundred forty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •