Recognised as Number
-1,707
- Negative
- Odd
- 4 digits
-1,707 is an odd 4-digit integer and the negative of 1,707. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value1,707
Digit count4
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 569
Distinct prime factors23, 569
Number of divisors4
Sum of divisors σ(n)2,280
SquarefreeYesno repeated prime factor
All divisors1, 3, 569, 1,7074 in total
Arithmetic
Representations
Decimal-1,707
Binary1101010101111 bits
Octal3253
Hexadecimal6AB
Base 361BF
In wordsminus one thousand, seven hundred and seven
Ordinalminus one thousand, seven hundred and seventh
Scientific notation-1.707 × 10^3
Engineering notation-1.707 × 10^3
In other bases
Ternary2100020base 3; the most digit-efficient integer base after e: 7 digits
Quinary23312base 5; one hand: 5 digits
Septenary4656base 7: 4 digits
Nonary2306base 9; each digit is two ternary digits: 4 digits
Duodecimalba3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal457base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal28:27base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT1T00T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111100101010101
Bit length11 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits4within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 10worth 1,024
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes206 ab
Gray code10111111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111100101010101two's complement
32-bit11111111111111111111100101010101two's complement
64-bit1111111111111111111111111111111111111111111111111111100101010101two's complement
One's complement0000011010101010at 16 bits, every bit flipped
Bits reversed1010101010011111at 16 bits
Rotated left by 11111001010101011at 16 bits, wrapping
Shifted left by 1-110101010110= -3,414, no wrap
Shifted right by 1-1101010110= -853, discarding the low bit
These bits as a double8.43370057 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-1,707 to the power 22,913,849
-1,707 to the power 3-4,973,940,243
-1,707 to the power 48,490,515,994,801
-1,707 to the power 5-14,493,310,803,125,307
First ten multiples-1,707, -3,414, -5,121, -6,828, -8,535, -10,242, -11,949, -13,656, -15,363, -17,070
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-170,700%
-1,707% as a decimal-17.07
-1,707% of 100-1,707
-1,707% of 1,000-17,070
As a fraction of 100-1,707/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -1,707
Nerdulate something else
Nothing in mind? Surprise me · today’s page