Recognised as Number
-1,061
- Negative
- Odd
- 4 digits
-1,061 is an odd 4-digit integer and the negative of 1,061. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value1,061
Digit count4
Digit sum8
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 1,061
Distinct prime factors11,061
Number of divisors2
Sum of divisors σ(n)1,062
SquarefreeYesno repeated prime factor
All divisors1, 1,0612 in total
Arithmetic
Representations
Decimal-1,061
Binary1000010010111 bits
Octal2045
Hexadecimal425
Base 36TH
In wordsminus one thousand and sixty-one
Ordinalminus one thousand and sixty-first
Scientific notation-1.061 × 10^3
Engineering notation-1.061 × 10^3
In other bases
Ternary1110022base 3; the most digit-efficient integer base after e: 7 digits
Quinary13221base 5; one hand: 5 digits
Septenary3044base 7: 4 digits
Nonary1408base 9; each digit is two ternary digits: 4 digits
Duodecimal745base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal2d1base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal17:41base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTTT0T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110000101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111101111011011
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 odd
Highest set bitbit 10worth 1,024
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes204 25
Gray code11000110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111101111011011two's complement
32-bit11111111111111111111101111011011two's complement
64-bit1111111111111111111111111111111111111111111111111111101111011011two's complement
One's complement0000010000100100at 16 bits, every bit flipped
Bits reversed1101101111011111at 16 bits
Rotated left by 11111011110110111at 16 bits, wrapping
Shifted left by 1-100001001010= -2,122, no wrap
Shifted right by 1-1000010011= -530, discarding the low bit
These bits as a double5.2420365 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-1,061 to the power 21,125,721
-1,061 to the power 3-1,194,389,981
-1,061 to the power 41,267,247,769,841
-1,061 to the power 5-1,344,549,883,801,301
First ten multiples-1,061, -2,122, -3,183, -4,244, -5,305, -6,366, -7,427, -8,488, -9,549, -10,610
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
As a percentage & fraction
As a percentage-106,100%
-1,061% as a decimal-10.61
-1,061% of 100-1,061
-1,061% of 1,000-10,610
As a fraction of 100-1,061/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -1,061
Nerdulate something else
Nothing in mind? Surprise me · today’s page