Recognised as Number
-55,971
- Negative
- Odd
- 5 digits
-55,971 is an odd 5-digit integer and the negative of 55,971. It has 10 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value55,971
Digit count5
Digit sum27
Digit product1,575
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^4 × 691
Distinct prime factors23, 691
Number of divisors10
Sum of divisors σ(n)83,732
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 81, 691, 2,073, 6,219, 18,657, 55,97110 in total
Arithmetic
Representations
Decimal-55,971
Binary110110101010001116 bits
Octal155243
HexadecimalDAA3
Base 36176R
In wordsminus fifty-five thousand, nine hundred and seventy-one
Ordinalminus fifty-five thousand, nine hundred and seventy-first
Scientific notation-5.5971 × 10^4
Engineering notation-55.971 × 10^3
In other bases
Ternary2211210000base 3; the most digit-efficient integer base after e: 10 digits
Quinary3242341base 5; one hand: 7 digits
Septenary322116base 7: 6 digits
Nonary84700base 9; each digit is two ternary digits: 5 digits
Duodecimal28483base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6jibbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:32:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT00111T0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110111101010101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110010010101011101
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 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
Bytes2da a3
Gray code1011011111110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110010010101011101two's complement
64-bit1111111111111111111111111111111111111111111111110010010101011101two's complement
One's complement00000000000000001101101010100010at 32 bits, every bit flipped
Bits reversed10111010101001001111111111111111at 32 bits
Rotated left by 111111111111111100100101010111011at 32 bits, wrapping
Shifted left by 1-11011010101000110= -111,942, no wrap
Shifted right by 1-110110101010010= -27,985, discarding the low bit
These bits as a double2.76533483 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-55,971 to the power 23,132,752,841
-55,971 to the power 3-175,343,309,263,611
-55,971 to the power 49,814,140,362,793,571,281
-55,971 to the power 5-549,307,250,245,918,978,168,851
First ten multiples-55,971, -111,942, -167,913, -223,884, -279,855, -335,826, -391,797, -447,768, -503,739, -559,710
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-5,597,100%
-55,971% as a decimal-559.71
-55,971% of 100-55,971
-55,971% of 1,000-559,710
As a fraction of 100-55,971/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -55,971
Nerdulate something else
Nothing in mind? Surprise me · today’s page