Recognised as Number

16,682

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value16,682

Digit count5

Digit sum23

Digit product576

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 19 × 439

Distinct prime factors32, 19, 439

Number of divisors8

Sum of divisors σ(n)26,400

Aliquot sum9,718sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,314the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,884

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 19, 38, 439, 878, 8,341, 16,6828 in total

Arithmetic

Previous number16,681

Next number16,683

Double33,364

Half8,341

Square278,289,124

Cube4,642,419,166,568

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

Cube root25.551478731≈

Negation-16,682

Reciprocal0.0000599449≈

Representations

Decimal16,682

Binary10000010010101015 bits

Octal40452

Hexadecimal412A

Base 36CVE

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

In wordssixteen thousand, six hundred and eighty-two

Ordinalsixteen thousand, six hundred and eighty-second

Scientific notation1.6682 × 10^4

Engineering notation16.682 × 10^3

In other bases

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

Quinary1013212base 5; one hand: 7 digits

Septenary66431base 7: 5 digits

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

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

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

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

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

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

Bit-level

0100000100101010

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 even

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes241 2a

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

At each machine width

16-bit0100000100101010

32-bit00000000000000000100000100101010

64-bit0000000000000000000000000000000000000000000000000100000100101010

One's complement1011111011010101at 16 bits, every bit flipped

Bits reversed0101010010000010at 16 bits

Rotated left by 11000001001010100at 16 bits, wrapping

Shifted left by 11000001001010100= 33,364, no wrap

Shifted right by 110000010010101= 8,341, discarding the low bit

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

Nearest landmarks

Next prime16,691+9

Previous prime16,673−9

Distance to nearest prime9

Nearest square below16,641

Nearest square above16,900

Powers & multiples

16,682 to the power 2278,289,124

16,682 to the power 34,642,419,166,568

16,682 to the power 477,444,836,536,687,376

16,682 to the power 51,291,934,763,105,018,806,432

First ten multiples16,682, 33,364, 50,046, 66,728, 83,410, 100,092, 116,774, 133,456, 150,138, 166,820

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 1

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10No, remainder 2

Divisible by 11No, remainder 6

Divisible by 12No, remainder 2

Divisible by 100No, remainder 82

Collatz (3n + 1) trajectory

Steps to reach 1128the total stopping time

Highest value reached25,0241× the starting value

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

First steps16,682 → 8,341 → 25,024 → 12,512 → 6,256 → 3,128 → 1,564 → 782 → 391 → 1,174 → …

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

As a percentage & fraction

As a percentage1,668,200%

16,682% as a decimal166.82

16,682% of 10016,682

16,682% of 1,000166,820

As a fraction of 10016,682/100

Read another way

As seconds4 hours, 38 minutes and 2 seconds

As bytes16.291 KiB

As a 24-bit colour#00412A

Keep nerding

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