Base | Representation |
---|---|
bin | 101101001111… |
… | …101111110101 |
3 | 211022121012121 |
4 | 231033233311 |
5 | 11014022411 |
6 | 1102115541 |
7 | 202550056 |
oct | 55175765 |
9 | 24277177 |
10 | 11860981 |
11 | 6771370 |
12 | 3b7bbb1 |
13 | 25c3942 |
14 | 180a72d |
15 | 1094571 |
hex | b4fbf5 |
11860981 has 8 divisors (see below), whose sum is σ = 13104000. Its totient is φ = 10645440.
The previous prime is 11860973. The next prime is 11860993. The reversal of 11860981 is 18906811.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11860981 - 23 = 11860973 is a prime.
It is a super-3 number, since 3×118609813 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11860081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5956 + ... + 7693.
It is an arithmetic number, because the mean of its divisors is an integer number (1638000).
Almost surely, 211860981 is an apocalyptic number.
11860981 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11860981 is a deficient number, since it is larger than the sum of its proper divisors (1243019).
11860981 is a wasteful number, since it uses less digits than its factorization.
11860981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13739.
The product of its (nonzero) digits is 3456, while the sum is 34.
The square root of 11860981 is about 3443.9774970229. The cubic root of 11860981 is about 228.0553177052.
The spelling of 11860981 in words is "eleven million, eight hundred sixty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •