Recognised as Number
-8,153
- Negative
- Odd
- 4 digits
-8,153 is an odd 4-digit integer and the negative of 8,153. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value8,153
Digit count4
Digit sum17
Digit product120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 31 × 263
Distinct prime factors231, 263
Number of divisors4
Sum of divisors σ(n)8,448
SquarefreeYesno repeated prime factor
All divisors1, 31, 263, 8,1534 in total
Arithmetic
Previous number-8,154
Next number-8,152
Double-16,306
Half-4,076.5
Square66,471,409
Cube-541,941,397,577
Cube root-20.126695715≈
Negation8,153
Reciprocal-0.0001226542≈
Representations
Decimal-8,153
Binary111111101100113 bits
Octal17731
Hexadecimal1FD9
Base 366AH
In wordsminus eight thousand, one hundred and fifty-three
Ordinalminus eight thousand, one hundred and fifty-third
Scientific notation-8.153 × 10^3
Engineering notation-8.153 × 10^3
In other bases
Ternary102011222base 3; the most digit-efficient integer base after e: 9 digits
Quinary230103base 5; one hand: 6 digits
Septenary32525base 7: 5 digits
Nonary12158base 9; each digit is two ternary digits: 5 digits
Duodecimal4875base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal107dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:15:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT1T11001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110000000100111
Bit length13 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits3within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes21f d9
Gray code1000000110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110000000100111two's complement
32-bit11111111111111111110000000100111two's complement
64-bit1111111111111111111111111111111111111111111111111110000000100111two's complement
One's complement0001111111011000at 16 bits, every bit flipped
Bits reversed1110010000000111at 16 bits
Rotated left by 11100000001001111at 16 bits, wrapping
Shifted left by 1-11111110110010= -16,306, no wrap
Shifted right by 1-111111101101= -4,076, discarding the low bit
These bits as a double4.02811721 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-8,153 to the power 266,471,409
-8,153 to the power 3-541,941,397,577
-8,153 to the power 44,418,448,214,445,281
-8,153 to the power 5-36,023,608,292,372,375,993
First ten multiples-8,153, -16,306, -24,459, -32,612, -40,765, -48,918, -57,071, -65,224, -73,377, -81,530
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 53
As a percentage & fraction
As a percentage-815,300%
-8,153% as a decimal-81.53
-8,153% of 100-8,153
-8,153% of 1,000-81,530
As a fraction of 100-8,153/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -8,153
Nerdulate something else
Nothing in mind? Surprise me · today’s page