Recognised as Number

16,871

Positive
Odd
Prime
5 digits

16,871 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value16,871

Digit count5

Digit sum23

Digit product336

Multiplicative persistence4times 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 factorisation16,871

Distinct prime factors116,871

Number of divisors2

Sum of divisors σ(n)16,872

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)16,870the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 16,8712 in total

Arithmetic

Previous number16,870

Next number16,872

Double33,742

Half8,435.5

Square284,630,641

Cube4,802,003,544,311

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

Cube root25.647612402≈

Negation-16,871

Reciprocal0.0000592733≈

Representations

Decimal16,871

Binary10000011110011115 bits

Octal40747

Hexadecimal41E7

Base 36D0N

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

In wordssixteen thousand, eight hundred and seventy-one

Ordinalsixteen thousand, eight hundred and seventy-first

Scientific notation1.6871 × 10^4

Engineering notation16.871 × 10^3

In other bases

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

Quinary1014441base 5; one hand: 7 digits

Septenary100121base 7: 6 digits

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

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

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

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

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

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

Bit-level

0100000111100111

Bit length15 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits7within that length

Bit parityeven8 set bits, so even; 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 e7

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

At each machine width

16-bit0100000111100111

32-bit00000000000000000100000111100111

64-bit0000000000000000000000000000000000000000000000000100000111100111

One's complement1011111000011000at 16 bits, every bit flipped

Bits reversed1110011110000010at 16 bits

Rotated left by 11000001111001110at 16 bits, wrapping

Shifted left by 11000001111001110= 33,742, no wrap

Shifted right by 110000011110011= 8,435, discarding the low bit

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

Nearest landmarks

Next prime16,879+8

Previous prime16,843−28

Distance to nearest prime0, it is prime

Nearest square below16,641

Nearest square above16,900

Powers & multiples

16,871 to the power 2284,630,641

16,871 to the power 34,802,003,544,311

16,871 to the power 481,014,601,796,070,881

16,871 to the power 51,366,797,346,901,511,833,351

First ten multiples16,871, 33,742, 50,613, 67,484, 84,355, 101,226, 118,097, 134,968, 151,839, 168,710

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 11

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time

Highest value reached192,18411× the starting value

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

First steps16,871 → 50,614 → 25,307 → 75,922 → 37,961 → 113,884 → 56,942 → 28,471 → 85,414 → 42,707 → …

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

As a percentage & fraction

As a percentage1,687,100%

16,871% as a decimal168.71

16,871% of 10016,871

16,871% of 1,000168,710

As a fraction of 10016,871/100

Read another way

As seconds4 hours, 41 minutes and 11 seconds

As bytes16.476 KiB

As a 24-bit colour#0041E7

Keep nerding

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