Recognised as Number
-56,387
- Negative
- Odd
- 5 digits
-56,387 is an odd 5-digit integer and the negative of 56,387. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value56,387
Digit count5
Digit sum29
Digit product5,040
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 113 × 499
Distinct prime factors2113, 499
Number of divisors4
Sum of divisors σ(n)57,000
SquarefreeYesno repeated prime factor
All divisors1, 113, 499, 56,3874 in total
Arithmetic
Representations
Decimal-56,387
Binary110111000100001116 bits
Octal156103
HexadecimalDC43
Base 3617IB
In wordsminus fifty-six thousand, three hundred and eighty-seven
Ordinalminus fifty-six thousand, three hundred and eighty-seventh
Scientific notation-5.6387 × 10^4
Engineering notation-56.387 × 10^3
In other bases
Ternary2212100102base 3; the most digit-efficient integer base after e: 10 digits
Quinary3301022base 5; one hand: 7 digits
Septenary323252base 7: 6 digits
Nonary85312base 9; each digit is two ternary digits: 5 digits
Duodecimal2876bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal70j7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:39:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0011T00TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110110010011001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110010001110111101
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
Bytes2dc 43
Gray code1011001001100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110010001110111101two's complement
64-bit1111111111111111111111111111111111111111111111110010001110111101two's complement
One's complement00000000000000001101110001000010at 32 bits, every bit flipped
Bits reversed10111101110001001111111111111111at 32 bits
Rotated left by 111111111111111100100011101111011at 32 bits, wrapping
Shifted left by 1-11011100010000110= -112,774, no wrap
Shifted right by 1-110111000100010= -28,193, discarding the low bit
These bits as a double2.78588796 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-56,387 to the power 23,179,493,769
-56,387 to the power 3-179,282,115,152,603
-56,387 to the power 410,109,180,627,109,825,361
-56,387 to the power 5-570,026,368,020,841,722,630,707
First ten multiples-56,387, -112,774, -169,161, -225,548, -281,935, -338,322, -394,709, -451,096, -507,483, -563,870
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 87
As a percentage & fraction
As a percentage-5,638,700%
-56,387% as a decimal-563.87
-56,387% of 100-56,387
-56,387% of 1,000-563,870
As a fraction of 100-56,387/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -56,387
Nerdulate something else
Nothing in mind? Surprise me · today’s page