Recognised as Number

55,686

Positive
Even
Composite
5 digits

55,686 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value55,686

Digit count5

Digit sum30

Digit product7,200

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 9,281

Distinct prime factors32, 3, 9,281

Number of divisors8

Sum of divisors σ(n)111,384

Aliquot sum55,698sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)9,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,560

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 9,281, 18,562, 27,843, 55,6868 in total

Arithmetic

Previous number55,685

Next number55,687

Double111,372

Half27,843

Square3,100,930,596

Cube172,678,421,168,856

Square root235.978812608≈irrational, shown to 9 decimal places

Cube root38.186982398≈

Negation-55,686

Reciprocal0.0000179578≈

Representations

Decimal55,686

Binary110110011000011016 bits

Octal154606

HexadecimalD986

Base 3616YU

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

In wordsfifty-five thousand, six hundred and eighty-six

Ordinalfifty-five thousand, six hundred and eighty-sixth

Scientific notation5.5686 × 10^4

Engineering notation55.686 × 10^3

In other bases

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

Quinary3240221base 5; one hand: 7 digits

Septenary321231base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101100110000110

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2d9 86

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

At each machine width

16-bit1101100110000110

32-bit00000000000000001101100110000110

64-bit0000000000000000000000000000000000000000000000001101100110000110

One's complement0010011001111001at 16 bits, every bit flipped

Bits reversed0110000110011011at 16 bits

Rotated left by 11011001100001101at 16 bits, wrapping

Shifted left by 111011001100001100= 111,372, no wrap

Shifted right by 1110110011000011= 27,843, discarding the low bit

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

Nearest landmarks

Next prime55,691+5

Previous prime55,681−5

Distance to nearest prime5

Nearest square below55,225

Nearest square above55,696

Powers & multiples

55,686 to the power 23,100,930,596

55,686 to the power 3172,678,421,168,856

55,686 to the power 49,615,770,561,208,915,216

55,686 to the power 5535,463,799,471,479,652,718,176

First ten multiples55,686, 111,372, 167,058, 222,744, 278,430, 334,116, 389,802, 445,488, 501,174, 556,860

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8No, remainder 6

Divisible by 9No, remainder 3

Divisible by 10No, remainder 6

Divisible by 11No, remainder 4

Divisible by 12No, remainder 6

Divisible by 100No, remainder 86

Collatz (3n + 1) trajectory

Steps to reach 1109the total stopping time

Highest value reached125,2962× the starting value

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

First steps55,686 → 27,843 → 83,530 → 41,765 → 125,296 → 62,648 → 31,324 → 15,662 → 7,831 → 23,494 → …

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

As a percentage & fraction

As a percentage5,568,600%

55,686% as a decimal556.86

55,686% of 10055,686

55,686% of 1,000556,860

As a fraction of 10055,686/100

Read another way

As seconds15 hours, 28 minutes and 6 seconds

As bytes54.381 KiB

As a 24-bit colour#00D986

Keep nerding

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