Nerdulator> put something in

Recognised as Number

53,887

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value53,887
Digit count5
Digit sum31
Digit product6,720
Multiplicative persistence2times 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 factorisation53,887
Distinct prime factors153,887
Number of divisors2
Sum of divisors σ(n)53,888
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)53,886integers below n that share no factor with it
Carmichael function λ(n)53,886the 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, 53,8872 in total

Arithmetic

Previous number53,886
Next number53,888
Double107,774
Square root232.135736155≈irrational, shown to 9 decimal places
Cube root37.77124807≈
Negation-53,887
Reciprocal0.0000185574≈

Representations

Decimal53,887
Binary110100100111111116 bits
Octal151177
HexadecimalD27F
Base 3615KV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-three thousand, eight hundred and eighty-seven
Ordinalfifty-three thousand, eight hundred and eighty-seventh
Scientific notation5.3887 × 10^4
Engineering notation53.887 × 10^3

In other bases

Ternary2201220211base 3; the most digit-efficient integer base after e: 10 digits
Quinary3211022base 5; one hand: 7 digits
Septenary313051base 7: 6 digits
Nonary81824base 9; each digit is two ternary digits: 5 digits
Duodecimal27227base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6ee7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:58:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10T1T0T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101001001111111
Bit length16 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits5within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2d2 7f
Gray code1011101101000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101001001111111
32-bit00000000000000001101001001111111
64-bit0000000000000000000000000000000000000000000000001101001001111111
One's complement0010110110000000at 16 bits, every bit flipped
Bits reversed1111111001001011at 16 bits
Rotated left by 11010010011111111at 16 bits, wrapping
Shifted left by 111010010011111110= 107,774, no wrap
Shifted right by 1110100100111111= 26,943, discarding the low bit
These bits as a double2.66237155 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime53,891+4
Previous prime53,881−6
Distance to nearest prime0, it is prime
Nearest square below53,824
Nearest square above54,289

Powers & multiples

53,887 to the power 22,903,808,769
53,887 to the power 3156,477,543,135,103
53,887 to the power 48,432,105,366,921,295,361
53,887 to the power 5454,380,861,907,287,843,118,207
First ten multiples53,887, 107,774, 161,661, 215,548, 269,435, 323,322, 377,209, 431,096, 484,983, 538,870
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

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 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time
Highest value reached2,071,63638× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps53,887 → 161,662 → 80,831 → 242,494 → 121,247 → 363,742 → 181,871 → 545,614 → 272,807 → 818,422 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,388,700%
53,887% as a decimal538.87
53,887% of 10053,887
53,887% of 1,000538,870
As a fraction of 10053,887/100

Read another way

As bytes52.624 KiB
As a 24-bit colour#00D27F

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “53887” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.