Recognised as Number

11,766

Positive
Even
Composite
5 digits

11,766 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value11,766

Digit count5

Digit sum21

Digit product252

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 37 × 53

Distinct prime factors42, 3, 37, 53

Number of divisors16

Sum of divisors σ(n)24,624

Aliquot sum12,858sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)3,744integers below n that share no factor with it

Carmichael function λ(n)468the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,744

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 37, 53, 74, 106, 111, 159, 222, 318, 1,961, 3,922, 5,883, 11,76616 in total

Arithmetic

Previous number11,765

Next number11,767

Double23,532

Half5,883

Square138,438,756

Cube1,628,870,403,096

Square root108.471194333≈irrational, shown to 9 decimal places

Cube root22.744494099≈

Negation-11,766

Reciprocal0.0000849907≈

Representations

Decimal11,766

Binary1011011111011014 bits

Octal26766

Hexadecimal2DF6

Base 3692U

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordseleven thousand, seven hundred and sixty-six

Ordinaleleven thousand, seven hundred and sixty-sixth

Scientific notation1.1766 × 10^4

Engineering notation11.766 × 10^3

In other bases

Ternary121010210base 3; the most digit-efficient integer base after e: 9 digits

Quinary334031base 5; one hand: 6 digits

Septenary46206base 7: 5 digits

Nonary17123base 9; each digit is two ternary digits: 5 digits

Duodecimal6986base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits

Vigesimal1986base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal3:16:6base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1TT1011T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary111001000001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010110111110110

Bit length14 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits4within that length

Bit parityeven10 set bits, so even; not the same as the number itself being even

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes22d f6

Gray code11101100001101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010110111110110

32-bit00000000000000000010110111110110

64-bit0000000000000000000000000000000000000000000000000010110111110110

One's complement1101001000001001at 16 bits, every bit flipped

Bits reversed0110111110110100at 16 bits

Rotated left by 10101101111101100at 16 bits, wrapping

Shifted left by 1101101111101100= 23,532, no wrap

Shifted right by 11011011111011= 5,883, discarding the low bit

These bits as a double5.81317639 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime11,777+11

Previous prime11,743−23

Distance to nearest prime11

Nearest square below11,664

Nearest square above11,881

Powers & multiples

11,766 to the power 2138,438,756

11,766 to the power 31,628,870,403,096

11,766 to the power 419,165,289,162,827,536

11,766 to the power 5225,498,792,289,828,788,576

First ten multiples11,766, 23,532, 35,298, 47,064, 58,830, 70,596, 82,362, 94,128, 105,894, 117,660

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6Yes

Divisible by 7No, remainder 6

Divisible by 8No, remainder 6

Divisible by 9No, remainder 3

Divisible by 10No, remainder 6

Divisible by 11No, remainder 7

Divisible by 12No, remainder 6

Divisible by 100No, remainder 66

Collatz (3n + 1) trajectory

Steps to reach 1143the total stopping time

Highest value reached50,2724× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps11,766 → 5,883 → 17,650 → 8,825 → 26,476 → 13,238 → 6,619 → 19,858 → 9,929 → 29,788 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,176,600%

11,766% as a decimal117.66

11,766% of 10011,766

11,766% of 1,000117,660

As a fraction of 10011,766/100

Read another way

As seconds3 hours, 16 minutes and 6 seconds

As bytes11.49 KiB

As a 24-bit colour#002DF6

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.