Recognised as Number

83,887

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value83,887

Digit count5

Digit sum34

Digit product10,752

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation149 × 563

Distinct prime factors2149, 563

Number of divisors4

Sum of divisors σ(n)84,600

Aliquot sum713sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)41,588the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 83,176

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

SquarefreeYesno repeated prime factor

All divisors1, 149, 563, 83,8874 in total

Arithmetic

Previous number83,886

Next number83,888

Double167,774

Half41,943.5

Square7,037,028,769

Cube590,315,232,345,103

Square root289.632525798≈irrational, shown to 9 decimal places

Cube root43.775544266≈

Negation-83,887

Reciprocal0.0000119208≈

Representations

Decimal83,887

Binary1010001111010111117 bits

Octal243657

Hexadecimal147AF

Base 361SQ7

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

In wordseighty-three thousand, eight hundred and eighty-seven

Ordinaleighty-three thousand, eight hundred and eighty-seventh

Scientific notation8.3887 × 10^4

Engineering notation83.887 × 10^3

In other bases

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

Quinary10141022base 5; one hand: 8 digits

Septenary466366base 7: 6 digits

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

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

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

Sexagesimal23:18:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010100011110101111

Bit length17 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits6within that length

Bit parityodd11 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 47 af

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

At each machine width

32-bit00000000000000010100011110101111

64-bit0000000000000000000000000000000000000000000000010100011110101111

One's complement11111111111111101011100001010000at 32 bits, every bit flipped

Bits reversed11110101111000101000000000000000at 32 bits

Rotated left by 100000000000000101000111101011110at 32 bits, wrapping

Shifted left by 1101000111101011110= 167,774, no wrap

Shifted right by 11010001111010111= 41,943, discarding the low bit

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

Nearest landmarks

Next prime83,891+4

Previous prime83,873−14

Distance to nearest prime4

Nearest square below83,521

Nearest square above84,100

Powers & multiples

83,887 to the power 27,037,028,769

83,887 to the power 3590,315,232,345,103

83,887 to the power 449,519,773,895,733,655,361

83,887 to the power 54,154,065,272,791,409,147,268,207

First ten multiples83,887, 167,774, 251,661, 335,548, 419,435, 503,322, 587,209, 671,096, 754,983, 838,870

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 1

Divisible by 12No, remainder 7

Divisible by 100No, remainder 87

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time

Highest value reached849,36410× the starting value

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

First steps83,887 → 251,662 → 125,831 → 377,494 → 188,747 → 566,242 → 283,121 → 849,364 → 424,682 → 212,341 → …

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

As a percentage & fraction

As a percentage8,388,700%

83,887% as a decimal838.87

83,887% of 10083,887

83,887% of 1,000838,870

As a fraction of 10083,887/100

Read another way

As seconds23 hours, 18 minutes and 7 seconds

As bytes81.921 KiB

As a 24-bit colour#0147AF

Keep nerding

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