Nerdulator> put something in

Recognised as Number

-637

  • Negative
  • Odd
  • 3 digits

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

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value637
Digit count3
Digit sum16
Digit product126
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 7^2 × 13
Distinct prime factors27, 13
Number of divisors6
Sum of divisors σ(n)798
SquarefreeNohas a repeated prime factor
All divisors1, 7, 13, 49, 91, 6376 in total

Arithmetic

Previous number-638
Next number-636
Double-1,274
Half-318.5
Square405,769
Cube root-8.604252449
Negation637
Reciprocal-0.0015698587

Representations

Decimal-637
Binary100111110110 bits
Octal1175
Hexadecimal27D
Base 36HP
In wordsminus six hundred and thirty-seven
Ordinalminus six hundred and thirty-seventh
Scientific notation-6.37 × 10^2
Engineering notation-637

In other bases

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

Bit-level

1111110110000011
Bit length10 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits3within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 9worth 512
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes202 7d
Gray code1101000011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110110000011two's complement
32-bit11111111111111111111110110000011two's complement
64-bit1111111111111111111111111111111111111111111111111111110110000011two's complement
One's complement0000001001111100at 16 bits, every bit flipped
Bits reversed1100000110111111at 16 bits
Rotated left by 11111101100000111at 16 bits, wrapping
Shifted left by 1-10011111010= -1,274, no wrap
Shifted right by 1-100111111= -318, discarding the low bit
These bits as a double3.14719816 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+639
Nearest square below625
Nearest square above676

Powers & multiples

-637 to the power 2405,769
-637 to the power 3-258,474,853
-637 to the power 4164,648,481,361
-637 to the power 5-104,881,082,626,957
First ten multiples-637, -1,274, -1,911, -2,548, -3,185, -3,822, -4,459, -5,096, -5,733, -6,370
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 2
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37

As a percentage & fraction

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