Recognised as Number
-10
- Negative
- Even
- 2 digits
-10 is an even 2-digit integer and the negative of 10. It has 4 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value10
Digit count2
Digit sum1
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5
Distinct prime factors22, 5
Number of divisors4
Sum of divisors σ(n)18
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 104 in total
Arithmetic
Representations
Decimal-10
Binary10104 bits
Octal12
HexadecimalA
Base 36A
In wordsminus ten
Ordinalminus tenth
Scientific notation-1 × 10^1
Engineering notation-10
In other bases
Ternary101base 3; the most digit-efficient integer base after e: 3 digits
Quinary20base 5; one hand: 2 digits
Septenary13base 7: 2 digits
Nonary11base 9; each digit is two ternary digits: 2 digits
Duodecimalabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 1 digit
Vigesimalabase 20; hands and feet, and the Mayan and Yoruba systems: 1 digit
Sexagesimal10base 60; Babylonian, and still how an hour and a circle are divided: 1 digit
Balanced ternaryT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11110110
Bit length4 bitsto write the magnitude
Set bits2the population count, or Hamming weight
Zero bits2within that length
Bit parityeven2 set bits, so even; not the same as the number itself being even
Highest set bitbit 3worth 8
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes10a
Gray code1111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
8-bit11110110two's complement
16-bit1111111111110110two's complement
32-bit11111111111111111111111111110110two's complement
64-bit1111111111111111111111111111111111111111111111111111111111110110two's complement
One's complement00001001at 8 bits, every bit flipped
Bits reversed01101111at 8 bits
Rotated left by 111101101at 8 bits, wrapping
Shifted left by 1-10100= -20, no wrap
Shifted right by 1-101= -5, discarding the low bit
These bits as a double4.94065646 × 10^-323≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-10 to the power 2100
-10 to the power 3-1,000
-10 to the power 410,000
-10 to the power 5-100,000
First ten multiples-10, -20, -30, -40, -50, -60, -70, -80, -90, -100
Powers of twoBetween 2^3 (8) and 2^4 (16)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 10
As a percentage & fraction
As a percentage-1,000%
-10% as a decimal-0.1
-10% of 100-10
-10% of 1,000-100
As a fraction of 100-10/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -10
Nerdulate something else
Nothing in mind? Surprise me · today’s page