Nerdulator> put something in

Recognised as Number

-649

  • Negative
  • Odd
  • 3 digits

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

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value649
Digit count3
Digit sum19
Digit product216
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 × 11 × 59
Distinct prime factors211, 59
Number of divisors4
Sum of divisors σ(n)720
SquarefreeYesno repeated prime factor
All divisors1, 11, 59, 6494 in total

Arithmetic

Previous number-650
Next number-648
Double-1,298
Half-324.5
Square421,201
Cube root-8.657946522
Negation649
Reciprocal-0.001540832

Representations

Decimal-649
Binary101000100110 bits
Octal1211
Hexadecimal289
Base 36I1
In wordsminus six hundred and forty-nine
Ordinalminus six hundred and forty-ninth
Scientific notation-6.49 × 10^2
Engineering notation-649

In other bases

Ternary220001base 3; the most digit-efficient integer base after e: 6 digits
Quinary10044base 5; one hand: 5 digits
Septenary1615base 7: 4 digits
Nonary801base 9; each digit is two ternary digits: 3 digits
Duodecimal461base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal1c9base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal10:49base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT01000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1010001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111110101110111
Bit length10 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits6within that length
Bit parityeven4 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 89
Gray code1111001101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110101110111two's complement
32-bit11111111111111111111110101110111two's complement
64-bit1111111111111111111111111111111111111111111111111111110101110111two's complement
One's complement0000001010001000at 16 bits, every bit flipped
Bits reversed1110111010111111at 16 bits
Rotated left by 11111101011101111at 16 bits, wrapping
Shifted left by 1-10100010010= -1,298, no wrap
Shifted right by 1-101000101= -324, discarding the low bit
These bits as a double3.20648604 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+651
Nearest square below625
Nearest square above676

Powers & multiples

-649 to the power 2421,201
-649 to the power 3-273,359,449
-649 to the power 4177,410,282,401
-649 to the power 5-115,139,273,278,249
First ten multiples-649, -1,298, -1,947, -2,596, -3,245, -3,894, -4,543, -5,192, -5,841, -6,490
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49

As a percentage & fraction

As a percentage-64,900%
-649% as a decimal-6.49
-649% of 100-649
-649% of 1,000-6,490
As a fraction of 100-649/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 “-649” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.