Recognised as Number
-1,080
- Negative
- Even
- 4 digits
-1,080 is an even 4-digit integer and the negative of 1,080. It has 32 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value1,080
Digit count4
Digit sum9
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^3 × 3^3 × 5
Distinct prime factors32, 3, 5
Number of divisors32
Sum of divisors σ(n)3,600
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 27, 30, 36, 40, 45, 54, 60, 72, 90, 108, 120, 135, 180, 216, 270, 360, 540, 1,08032 in total
Arithmetic
Representations
Decimal-1,080
Binary1000011100011 bits
Octal2070
Hexadecimal438
Base 36U0
In wordsminus one thousand and eighty
Ordinalminus one thousand and eightieth
Scientific notation-1.08 × 10^3
Engineering notation-1.08 × 10^3
In other bases
Ternary1111000base 3; the most digit-efficient integer base after e: 7 digits
Quinary13310base 5; one hand: 5 digits
Septenary3102base 7: 4 digits
Nonary1430base 9; each digit is two ternary digits: 4 digits
Duodecimal760base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal2e0base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal18:0base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTTTT000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110011011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111101111001000
Bit length11 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits7within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 10worth 1,024
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes204 38
Gray code11000100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111101111001000two's complement
32-bit11111111111111111111101111001000two's complement
64-bit1111111111111111111111111111111111111111111111111111101111001000two's complement
One's complement0000010000110111at 16 bits, every bit flipped
Bits reversed0001001111011111at 16 bits
Rotated left by 11111011110010001at 16 bits, wrapping
Shifted left by 1-100001110000= -2,160, no wrap
Shifted right by 1-1000011100= -540, discarding the low bit
These bits as a double5.33590898 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-1,080 to the power 21,166,400
-1,080 to the power 3-1,259,712,000
-1,080 to the power 41,360,488,960,000
-1,080 to the power 5-1,469,328,076,800,000
First ten multiples-1,080, -2,160, -3,240, -4,320, -5,400, -6,480, -7,560, -8,640, -9,720, -10,800
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12Yes
Divisible by 100No, remainder 80
As a percentage & fraction
As a percentage-108,000%
-1,080% as a decimal-10.8
-1,080% of 100-1,080
-1,080% of 1,000-10,800
As a fraction of 100-1,080/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -1,080
Nerdulate something else
Nothing in mind? Surprise me · today’s page