Nerdulator> put something in

Recognised as Number

-657

  • Negative
  • Odd
  • 3 digits

-657 is an odd 3-digit integer and the negative of 657. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value657
Digit count3
Digit sum18
Digit product210
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3^2 × 73
Distinct prime factors23, 73
Number of divisors6
Sum of divisors σ(n)962
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 73, 219, 6576 in total

Arithmetic

Previous number-658
Next number-656
Double-1,314
Half-328.5
Square431,649
Cube root-8.693375853
Negation657
Reciprocal-0.00152207

Representations

Decimal-657
Binary101001000110 bits
Octal1221
Hexadecimal291
Base 36I9
In wordsminus six hundred and fifty-seven
Ordinalminus six hundred and fifty-seventh
Scientific notation-6.57 × 10^2
Engineering notation-657

In other bases

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

Bit-level

1111110101101111
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 91
Gray code1111011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110101101111two's complement
32-bit11111111111111111111110101101111two's complement
64-bit1111111111111111111111111111111111111111111111111111110101101111two's complement
One's complement0000001010010000at 16 bits, every bit flipped
Bits reversed1111011010111111at 16 bits
Rotated left by 11111101011011111at 16 bits, wrapping
Shifted left by 1-10100100010= -1,314, no wrap
Shifted right by 1-101001001= -328, discarding the low bit
These bits as a double3.24601129 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+659
Nearest square below625
Nearest square above676

Powers & multiples

-657 to the power 2431,649
-657 to the power 3-283,593,393
-657 to the power 4186,320,859,201
-657 to the power 5-122,412,804,495,057
First ten multiples-657, -1,314, -1,971, -2,628, -3,285, -3,942, -4,599, -5,256, -5,913, -6,570
Powers of twoBetween 2^9 (512) and 2^10 (1,024)

Divisibility tests

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

As a percentage & fraction

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