Recognised as Number

16,681

Positive
Odd
Composite
5 digits

16,681 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value16,681

Digit count5

Digit sum22

Digit product288

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 2,383

Distinct prime factors27, 2,383

Number of divisors4

Sum of divisors σ(n)19,072

Aliquot sum2,391sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,382the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,292

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 2,383, 16,6814 in total

Arithmetic

Previous number16,680

Next number16,682

Double33,362

Half8,340.5

Square278,255,761

Cube4,641,584,349,241

Square root129.154945705≈irrational, shown to 9 decimal places

Cube root25.550968161≈

Negation-16,681

Reciprocal0.0000599484≈

Representations

Decimal16,681

Binary10000010010100115 bits

Octal40451

Hexadecimal4129

Base 36CVD

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

In wordssixteen thousand, six hundred and eighty-one

Ordinalsixteen thousand, six hundred and eighty-first

Scientific notation1.6681 × 10^4

Engineering notation16.681 × 10^3

In other bases

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

Quinary1013211base 5; one hand: 7 digits

Septenary66430base 7: 5 digits

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

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

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

Sexagesimal4:38:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0100000100101001

Bit length15 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits10within that length

Bit parityodd5 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes241 29

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

At each machine width

16-bit0100000100101001

32-bit00000000000000000100000100101001

64-bit0000000000000000000000000000000000000000000000000100000100101001

One's complement1011111011010110at 16 bits, every bit flipped

Bits reversed1001010010000010at 16 bits

Rotated left by 11000001001010010at 16 bits, wrapping

Shifted left by 11000001001010010= 33,362, no wrap

Shifted right by 110000010010100= 8,340, discarding the low bit

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

Nearest landmarks

Next prime16,691+10

Previous prime16,673−8

Distance to nearest prime8

Nearest square below16,641

Nearest square above16,900

Powers & multiples

16,681 to the power 2278,255,761

16,681 to the power 34,641,584,349,241

16,681 to the power 477,426,268,529,689,121

16,681 to the power 51,291,547,585,343,744,227,401

First ten multiples16,681, 33,362, 50,043, 66,724, 83,405, 100,086, 116,767, 133,448, 150,129, 166,810

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1115the total stopping time

Highest value reached190,02411× the starting value

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

First steps16,681 → 50,044 → 25,022 → 12,511 → 37,534 → 18,767 → 56,302 → 28,151 → 84,454 → 42,227 → …

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

As a percentage & fraction

As a percentage1,668,100%

16,681% as a decimal166.81

16,681% of 10016,681

16,681% of 1,000166,810

As a fraction of 10016,681/100

Read another way

As seconds4 hours, 38 minutes and 1 second

As bytes16.29 KiB

As a 24-bit colour#004129

Keep nerding

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