Recognised as Number
-8,553
- Negative
- Odd
- 4 digits
-8,553 is an odd 4-digit integer and the negative of 8,553. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value8,553
Digit count4
Digit sum21
Digit product600
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 2,851
Distinct prime factors23, 2,851
Number of divisors4
Sum of divisors σ(n)11,408
SquarefreeYesno repeated prime factor
All divisors1, 3, 2,851, 8,5534 in total
Arithmetic
Previous number-8,554
Next number-8,552
Double-17,106
Half-4,276.5
Square73,153,809
Cube-625,684,528,377
Cube root-20.450604853≈
Negation8,553
Reciprocal-0.000116918≈
Representations
Decimal-8,553
Binary1000010110100114 bits
Octal20551
Hexadecimal2169
Base 366LL
In wordsminus eight thousand, five hundred and fifty-three
Ordinalminus eight thousand, five hundred and fifty-third
Scientific notation-8.553 × 10^3
Engineering notation-8.553 × 10^3
In other bases
Ternary102201210base 3; the most digit-efficient integer base after e: 9 digits
Quinary233203base 5; one hand: 6 digits
Septenary33636base 7: 5 digits
Nonary12653base 9; each digit is two ternary digits: 5 digits
Duodecimal4b49base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal117dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:22:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT01T11T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001111101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101111010010111
Bit length14 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits8within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes221 69
Gray code11000111011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101111010010111two's complement
32-bit11111111111111111101111010010111two's complement
64-bit1111111111111111111111111111111111111111111111111101111010010111two's complement
One's complement0010000101101000at 16 bits, every bit flipped
Bits reversed1110100101111011at 16 bits
Rotated left by 11011110100101111at 16 bits, wrapping
Shifted left by 1-100001011010010= -17,106, no wrap
Shifted right by 1-1000010110101= -4,276, discarding the low bit
These bits as a double4.22574347 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-8,553 to the power 273,153,809
-8,553 to the power 3-625,684,528,377
-8,553 to the power 45,351,479,771,208,481
-8,553 to the power 5-45,771,206,483,146,137,993
First ten multiples-8,553, -17,106, -25,659, -34,212, -42,765, -51,318, -59,871, -68,424, -76,977, -85,530
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 53
As a percentage & fraction
As a percentage-855,300%
-8,553% as a decimal-85.53
-8,553% of 100-8,553
-8,553% of 1,000-85,530
As a fraction of 100-8,553/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -8,553
Nerdulate something else
Nothing in mind? Surprise me · today’s page