Recognised as Number
-1,667
- Negative
- Odd
- 4 digits
-1,667 is an odd 4-digit integer and the negative of 1,667. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value1,667
Digit count4
Digit sum20
Digit product252
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 1,667
Distinct prime factors11,667
Number of divisors2
Sum of divisors σ(n)1,668
SquarefreeYesno repeated prime factor
All divisors1, 1,6672 in total
Arithmetic
Representations
Decimal-1,667
Binary1101000001111 bits
Octal3203
Hexadecimal683
Base 361AB
In wordsminus one thousand, six hundred and sixty-seven
Ordinalminus one thousand, six hundred and sixty-seventh
Scientific notation-1.667 × 10^3
Engineering notation-1.667 × 10^3
In other bases
Ternary2021202base 3; the most digit-efficient integer base after e: 7 digits
Quinary23132base 5; one hand: 5 digits
Septenary4601base 7: 4 digits
Nonary2252base 9; each digit is two ternary digits: 4 digits
Duodecimalb6bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal437base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal27:47base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT1T011T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111100101111101
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 odd
Highest set bitbit 10worth 1,024
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes206 83
Gray code10111000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111100101111101two's complement
32-bit11111111111111111111100101111101two's complement
64-bit1111111111111111111111111111111111111111111111111111100101111101two's complement
One's complement0000011010000010at 16 bits, every bit flipped
Bits reversed1011111010011111at 16 bits
Rotated left by 11111001011111011at 16 bits, wrapping
Shifted left by 1-110100000110= -3,334, no wrap
Shifted right by 1-1101000010= -833, discarding the low bit
These bits as a double8.23607432 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-1,667 to the power 22,778,889
-1,667 to the power 3-4,632,407,963
-1,667 to the power 47,722,224,074,321
-1,667 to the power 5-12,872,947,531,893,107
First ten multiples-1,667, -3,334, -5,001, -6,668, -8,335, -10,002, -11,669, -13,336, -15,003, -16,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-166,700%
-1,667% as a decimal-16.67
-1,667% of 100-1,667
-1,667% of 1,000-16,670
As a fraction of 100-1,667/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -1,667
Nerdulate something else
Nothing in mind? Surprise me · today’s page