Recognised as Number
-55,721
- Negative
- Odd
- 5 digits
-55,721 is an odd 5-digit integer and the negative of 55,721. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value55,721
Digit count5
Digit sum20
Digit product350
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 × 55,721
Distinct prime factors155,721
Number of divisors2
Sum of divisors σ(n)55,722
SquarefreeYesno repeated prime factor
All divisors1, 55,7212 in total
Arithmetic
Representations
Decimal-55,721
Binary110110011010100116 bits
Octal154651
HexadecimalD9A9
Base 3616ZT
In wordsminus fifty-five thousand, seven hundred and twenty-one
Ordinalminus fifty-five thousand, seven hundred and twenty-first
Scientific notation-5.5721 × 10^4
Engineering notation-55.721 × 10^3
In other bases
Ternary2211102202base 3; the most digit-efficient integer base after e: 10 digits
Quinary3240341base 5; one hand: 7 digits
Septenary321311base 7: 6 digits
Nonary84382base 9; each digit is two ternary digits: 5 digits
Duodecimal282b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6j61base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:28:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01TTTT01T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110111101110101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110010011001010111
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
Bytes2d9 a9
Gray code1011010101111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110010011001010111two's complement
64-bit1111111111111111111111111111111111111111111111110010011001010111two's complement
One's complement00000000000000001101100110101000at 32 bits, every bit flipped
Bits reversed11101010011001001111111111111111at 32 bits
Rotated left by 111111111111111100100110010101111at 32 bits, wrapping
Shifted left by 1-11011001101010010= -111,442, no wrap
Shifted right by 1-110110011010101= -27,860, discarding the low bit
These bits as a double2.75298319 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-55,721 to the power 23,104,829,841
-55,721 to the power 3-173,004,223,570,361
-55,721 to the power 49,639,968,341,564,085,281
-55,721 to the power 5-537,148,675,960,292,395,942,601
First ten multiples-55,721, -111,442, -167,163, -222,884, -278,605, -334,326, -390,047, -445,768, -501,489, -557,210
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-5,572,100%
-55,721% as a decimal-557.21
-55,721% of 100-55,721
-55,721% of 1,000-557,210
As a fraction of 100-55,721/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -55,721
Nerdulate something else
Nothing in mind? Surprise me · today’s page