Recognised as Number

55,889

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value55,889

Digit count5

Digit sum35

Digit product14,400

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation55,889

Distinct prime factors155,889

Number of divisors2

Sum of divisors σ(n)55,890

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)55,888the 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, 55,8892 in total

Arithmetic

Previous number55,888

Next number55,890

Double111,778

Half27,944.5

Square3,123,580,321

Cube174,573,780,560,369

Square root236.408544685≈irrational, shown to 9 decimal places

Cube root38.233328916≈

Negation-55,889

Reciprocal0.0000178926≈

Representations

Decimal55,889

Binary110110100101000116 bits

Octal155121

HexadecimalDA51

Base 36174H

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

In wordsfifty-five thousand, eight hundred and eighty-nine

Ordinalfifty-five thousand, eight hundred and eighty-ninth

Scientific notation5.5889 × 10^4

Engineering notation55.889 × 10^3

In other bases

Ternary2211122222base 3; the most digit-efficient integer base after e: 10 digits

Quinary3242024base 5; one hand: 7 digits

Septenary321641base 7: 6 digits

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

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

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

Sexagesimal15:31:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1101101001010001

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2da 51

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

At each machine width

16-bit1101101001010001

32-bit00000000000000001101101001010001

64-bit0000000000000000000000000000000000000000000000001101101001010001

One's complement0010010110101110at 16 bits, every bit flipped

Bits reversed1000101001011011at 16 bits

Rotated left by 11011010010100011at 16 bits, wrapping

Shifted left by 111011010010100010= 111,778, no wrap

Shifted right by 1110110100101000= 27,944, discarding the low bit

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

Nearest landmarks

Next prime55,897+8

Previous prime55,871−18

Distance to nearest prime0, it is prime

Nearest square below55,696

Nearest square above56,169

Powers & multiples

55,889 to the power 23,123,580,321

55,889 to the power 3174,573,780,560,369

55,889 to the power 49,756,754,021,738,463,041

55,889 to the power 5545,295,225,520,940,960,898,449

First ten multiples55,889, 111,778, 167,667, 223,556, 279,445, 335,334, 391,223, 447,112, 503,001, 558,890

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 9

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time

Highest value reached453,2568× the starting value

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

First steps55,889 → 167,668 → 83,834 → 41,917 → 125,752 → 62,876 → 31,438 → 15,719 → 47,158 → 23,579 → …

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

As a percentage & fraction

As a percentage5,588,900%

55,889% as a decimal558.89

55,889% of 10055,889

55,889% of 1,000558,890

As a fraction of 10055,889/100

Read another way

As seconds15 hours, 31 minutes and 29 seconds

As bytes54.579 KiB

As a 24-bit colour#00DA51

Keep nerding

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