Recognised as Number
-1,078
- Negative
- Even
- 4 digits
-1,078 is an even 4-digit integer and the negative of 1,078. It has 12 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value1,078
Digit count4
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 7^2 × 11
Distinct prime factors32, 7, 11
Number of divisors12
Sum of divisors σ(n)2,052
SquarefreeNohas a repeated prime factor
All divisors1, 2, 7, 11, 14, 22, 49, 77, 98, 154, 539, 1,07812 in total
Arithmetic
Representations
Decimal-1,078
Binary1000011011011 bits
Octal2066
Hexadecimal436
Base 36TY
In wordsminus one thousand and seventy-eight
Ordinalminus one thousand and seventy-eighth
Scientific notation-1.078 × 10^3
Engineering notation-1.078 × 10^3
In other bases
Ternary1110221base 3; the most digit-efficient integer base after e: 7 digits
Quinary13303base 5; one hand: 5 digits
Septenary3100base 7: 4 digits
Nonary1427base 9; each digit is two ternary digits: 4 digits
Duodecimal75abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal2dibase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal17:58base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTTTT01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110011011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111101111001010
Bit length11 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits6within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 10worth 1,024
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes204 36
Gray code11000101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111101111001010two's complement
32-bit11111111111111111111101111001010two's complement
64-bit1111111111111111111111111111111111111111111111111111101111001010two's complement
One's complement0000010000110101at 16 bits, every bit flipped
Bits reversed0101001111011111at 16 bits
Rotated left by 11111011110010101at 16 bits, wrapping
Shifted left by 1-100001101100= -2,156, no wrap
Shifted right by 1-1000011011= -539, discarding the low bit
These bits as a double5.32602766 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-1,078 to the power 21,162,084
-1,078 to the power 3-1,252,726,552
-1,078 to the power 41,350,439,223,056
-1,078 to the power 5-1,455,773,482,454,368
First ten multiples-1,078, -2,156, -3,234, -4,312, -5,390, -6,468, -7,546, -8,624, -9,702, -10,780
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11Yes
Divisible by 12No, remainder 10
Divisible by 100No, remainder 78
As a percentage & fraction
As a percentage-107,800%
-1,078% as a decimal-10.78
-1,078% of 100-1,078
-1,078% of 1,000-10,780
As a fraction of 100-1,078/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -1,078
Nerdulate something else
Nothing in mind? Surprise me · today’s page