Nerdulator> put something in

Recognised as Number

-635

  • Negative
  • Odd
  • 3 digits

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

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value635
Digit count3
Digit sum14
Digit product90
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 5 × 127
Distinct prime factors25, 127
Number of divisors4
Sum of divisors σ(n)768
SquarefreeYesno repeated prime factor
All divisors1, 5, 127, 6354 in total

Arithmetic

Previous number-636
Next number-634
Double-1,270
Half-317.5
Square403,225
Cube root-8.595238034
Negation635
Reciprocal-0.0015748031

Representations

Decimal-635
Binary100111101110 bits
Octal1173
Hexadecimal27B
Base 36HN
In wordsminus six hundred and thirty-five
Ordinalminus six hundred and thirty-fifth
Scientific notation-6.35 × 10^2
Engineering notation-635

In other bases

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

Bit-level

1111110110000101
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 7b
Gray code1101000110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110110000101two's complement
32-bit11111111111111111111110110000101two's complement
64-bit1111111111111111111111111111111111111111111111111111110110000101two's complement
One's complement0000001001111010at 16 bits, every bit flipped
Bits reversed1010000110111111at 16 bits
Rotated left by 11111101100001011at 16 bits, wrapping
Shifted left by 1-10011110110= -1,270, no wrap
Shifted right by 1-100111110= -317, discarding the low bit
These bits as a double3.13731685 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+637
Nearest square below625
Nearest square above676

Powers & multiples

-635 to the power 2403,225
-635 to the power 3-256,047,875
-635 to the power 4162,590,400,625
-635 to the power 5-103,244,904,396,875
First ten multiples-635, -1,270, -1,905, -2,540, -3,175, -3,810, -4,445, -5,080, -5,715, -6,350
Powers of twoBetween 2^9 (512) and 2^10 (1,024)

Divisibility tests

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

As a percentage & fraction

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