Recognised as Number

81,987

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value81,987

Digit count5

Digit sum33

Digit product4,032

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 27,329

Distinct prime factors23, 27,329

Number of divisors4

Sum of divisors σ(n)109,320

Aliquot sum27,333sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)27,328the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 54,656

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 27,329, 81,9874 in total

Arithmetic

Previous number81,986

Next number81,988

Double163,974

Half40,993.5

Square6,721,868,169

Cube551,105,805,571,803

Square root286.333721381≈irrational, shown to 9 decimal places

Cube root43.442518872≈

Negation-81,987

Reciprocal0.0000121971≈

Representations

Decimal81,987

Binary1010000000100001117 bits

Octal240103

Hexadecimal14043

Base 361R9F

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

In wordseighty-one thousand, nine hundred and eighty-seven

Ordinaleighty-one thousand, nine hundred and eighty-seventh

Scientific notation8.1987 × 10^4

Engineering notation81.987 × 10^3

In other bases

Ternary11011110120base 3; the most digit-efficient integer base after e: 11 digits

Quinary10110422base 5; one hand: 8 digits

Septenary461013base 7: 6 digits

Nonary134416base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal22:46:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010100000001000011

Bit length17 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits12within that length

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

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 40 43

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

At each machine width

32-bit00000000000000010100000001000011

64-bit0000000000000000000000000000000000000000000000010100000001000011

One's complement11111111111111101011111110111100at 32 bits, every bit flipped

Bits reversed11000010000000101000000000000000at 32 bits

Rotated left by 100000000000000101000000010000110at 32 bits, wrapping

Shifted left by 1101000000010000110= 163,974, no wrap

Shifted right by 11010000000100001= 40,993, discarding the low bit

These bits as a double4.05069601 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime82,003+16

Previous prime81,973−14

Distance to nearest prime14

Nearest square below81,796

Nearest square above82,369

Powers & multiples

81,987 to the power 26,721,868,169

81,987 to the power 3551,105,805,571,803

81,987 to the power 445,183,511,681,415,412,561

81,987 to the power 53,704,460,572,224,205,429,638,707

First ten multiples81,987, 163,974, 245,961, 327,948, 409,935, 491,922, 573,909, 655,896, 737,883, 819,870

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 7

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 87

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time

Highest value reached368,9444× the starting value

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

First steps81,987 → 245,962 → 122,981 → 368,944 → 184,472 → 92,236 → 46,118 → 23,059 → 69,178 → 34,589 → …

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

As a percentage & fraction

As a percentage8,198,700%

81,987% as a decimal819.87

81,987% of 10081,987

81,987% of 1,000819,870

As a fraction of 10081,987/100

Read another way

As seconds22 hours, 46 minutes and 27 seconds

As bytes80.065 KiB

As a 24-bit colour#014043

Keep nerding

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