Nerdulator> put something in

Recognised as Number

-562

  • Negative
  • Even
  • 3 digits

-562 is an even 3-digit integer and the negative of 562. It has 4 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value562
Digit count3
Digit sum13
Digit product60
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2 × 281
Distinct prime factors22, 281
Number of divisors4
Sum of divisors σ(n)846
SquarefreeYesno repeated prime factor
All divisors1, 2, 281, 5624 in total

Arithmetic

Previous number-563
Next number-561
Double-1,124
Half-281
Square315,844
Cube root-8.252371525
Negation562
Reciprocal-0.0017793594

Representations

Decimal-562
Binary100011001010 bits
Octal1062
Hexadecimal232
Base 36FM
In wordsminus five hundred and sixty-two
Ordinalminus five hundred and sixty-second
Scientific notation-5.62 × 10^2
Engineering notation-562

In other bases

Ternary202211base 3; the most digit-efficient integer base after e — 6 digits
Quinary4222base 5; one hand — 4 digits
Septenary1432base 7 — 4 digits
Nonary684base 9; each digit is two ternary digits — 3 digits
Duodecimal3aabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves — 3 digits
Vigesimal182base 20; hands and feet, and the Mayan and Yoruba systems — 3 digits
Sexagesimal9:22base 60; Babylonian, and still how an hour and a circle are divided — 2 digits
Balanced ternaryT1T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1011010010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111110111001110
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 even
Highest set bitbit 9worth 512
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes202 32
Gray code1100101011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110111001110two's complement
32-bit11111111111111111111110111001110two's complement
64-bit1111111111111111111111111111111111111111111111111111110111001110two's complement
One's complement0000001000110001at 16 bits, every bit flipped
Bits reversed0111001110111111at 16 bits
Rotated left by 11111101110011101at 16 bits, wrapping
Shifted left by 1-10001100100= -1,124, no wrap
Shifted right by 1-100011001= -281, discarding the low bit
These bits as a double2.77664893 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+564
Nearest square below529
Nearest square above576

Powers & multiples

-562 to the power 2315,844
-562 to the power 3-177,504,328
-562 to the power 499,757,432,336
-562 to the power 5-56,063,676,972,832
First ten multiples-562, -1,124, -1,686, -2,248, -2,810, -3,372, -3,934, -4,496, -5,058, -5,620
Powers of twoBetween 2^9 (512) and 2^10 (1,024)

Divisibility tests

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

As a percentage & fraction

As a percentage-56,200%
-562% as a decimal-5.62
-562% of 100-562
-562% of 1,000-5,620
As a fraction of 100-562/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 “-562” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.