Recognised as Number
-1,660
- Negative
- Even
- 4 digits
-1,660 is an even 4-digit integer and the negative of 1,660. It has 12 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value1,660
Digit count4
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 5 × 83
Distinct prime factors32, 5, 83
Number of divisors12
Sum of divisors σ(n)3,528
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 83, 166, 332, 415, 830, 1,66012 in total
Arithmetic
Representations
Decimal-1,660
Binary1100111110011 bits
Octal3174
Hexadecimal67C
Base 361A4
In wordsminus one thousand, six hundred and sixty
Ordinalminus one thousand, six hundred and sixtieth
Scientific notation-1.66 × 10^3
Engineering notation-1.66 × 10^3
In other bases
Ternary2021111base 3; the most digit-efficient integer base after e: 7 digits
Quinary23120base 5; one hand: 5 digits
Septenary4561base 7: 4 digits
Nonary2244base 9; each digit is two ternary digits: 4 digits
Duodecimalb64base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal430base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal27:40base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT1T1TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111100110000100
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 even
Highest set bitbit 10worth 1,024
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes206 7c
Gray code10101000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111100110000100two's complement
32-bit11111111111111111111100110000100two's complement
64-bit1111111111111111111111111111111111111111111111111111100110000100two's complement
One's complement0000011001111011at 16 bits, every bit flipped
Bits reversed0010000110011111at 16 bits
Rotated left by 11111001100001001at 16 bits, wrapping
Shifted left by 1-110011111000= -3,320, no wrap
Shifted right by 1-1100111110= -830, discarding the low bit
These bits as a double8.20148972 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-1,660 to the power 22,755,600
-1,660 to the power 3-4,574,296,000
-1,660 to the power 47,593,331,360,000
-1,660 to the power 5-12,604,930,057,600,000
First ten multiples-1,660, -3,320, -4,980, -6,640, -8,300, -9,960, -11,620, -13,280, -14,940, -16,600
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 4
Divisible by 100No, remainder 60
As a percentage & fraction
As a percentage-166,000%
-1,660% as a decimal-16.6
-1,660% of 100-1,660
-1,660% of 1,000-16,600
As a fraction of 100-1,660/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -1,660
Nerdulate something else
Nothing in mind? Surprise me · today’s page