Nerdulator> put something in

Recognised as Number

-667

  • Negative
  • Odd
  • 3 digits

-667 is an odd 3-digit integer and the negative of 667. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value667
Digit count3
Digit sum19
Digit product252
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 23 × 29
Distinct prime factors223, 29
Number of divisors4
Sum of divisors σ(n)720
SquarefreeYesno repeated prime factor
All divisors1, 23, 29, 6674 in total

Arithmetic

Previous number-668
Next number-666
Double-1,334
Half-333.5
Square444,889
Cube root-8.737260372
Negation667
Reciprocal-0.0014992504

Representations

Decimal-667
Binary101001101110 bits
Octal1233
Hexadecimal29B
Base 36IJ
In wordsminus six hundred and sixty-seven
Ordinalminus six hundred and sixty-seventh
Scientific notation-6.67 × 10^2
Engineering notation-667

In other bases

Ternary220201base 3; the most digit-efficient integer base after e: 6 digits
Quinary10132base 5; one hand: 5 digits
Septenary1642base 7: 4 digits
Nonary821base 9; each digit is two ternary digits: 3 digits
Duodecimal477base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal1d7base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal11:7base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT01T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1010100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111110101100101
Bit length10 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits4within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 9worth 512
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes202 9b
Gray code1111010110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110101100101two's complement
32-bit11111111111111111111110101100101two's complement
64-bit1111111111111111111111111111111111111111111111111111110101100101two's complement
One's complement0000001010011010at 16 bits, every bit flipped
Bits reversed1010011010111111at 16 bits
Rotated left by 11111101011001011at 16 bits, wrapping
Shifted left by 1-10100110110= -1,334, no wrap
Shifted right by 1-101001110= -333, discarding the low bit
These bits as a double3.29541786 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+669
Nearest square below625
Nearest square above676

Powers & multiples

-667 to the power 2444,889
-667 to the power 3-296,740,963
-667 to the power 4197,926,222,321
-667 to the power 5-132,016,790,288,107
First ten multiples-667, -1,334, -2,001, -2,668, -3,335, -4,002, -4,669, -5,336, -6,003, -6,670
Powers of twoBetween 2^9 (512) and 2^10 (1,024)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67

As a percentage & fraction

As a percentage-66,700%
-667% as a decimal-6.67
-667% of 100-667
-667% of 1,000-6,670
As a fraction of 100-667/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “-667” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.