Nerdulator> put something in

Recognised as Number

-489

  • Negative
  • Odd
  • 3 digits

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

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value489
Digit count3
Digit sum21
Digit product288
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3 × 163
Distinct prime factors23, 163
Number of divisors4
Sum of divisors σ(n)656
SquarefreeYesno repeated prime factor
All divisors1, 3, 163, 4894 in total

Arithmetic

Previous number-490
Next number-488
Double-978
Half-244.5
Square239,121
Cube root-7.878368425
Negation489
Reciprocal-0.0020449898

Representations

Decimal-489
Binary1111010019 bits
Octal751
Hexadecimal1E9
Base 36DL
In wordsminus four hundred and eighty-nine
Ordinalminus four hundred and eighty-ninth
Scientific notation-4.89 × 10^2
Engineering notation-489

In other bases

Ternary200010base 3; the most digit-efficient integer base after e: 6 digits
Quinary3424base 5; one hand: 4 digits
Septenary1266base 7: 4 digits
Nonary603base 9; each digit is two ternary digits: 3 digits
Duodecimal349base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal149base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal8:9base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT1000T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111000010111
Bit length9 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits3within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 8worth 256
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes201 e9
Gray code100011101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111111000010111two's complement
32-bit11111111111111111111111000010111two's complement
64-bit1111111111111111111111111111111111111111111111111111111000010111two's complement
One's complement0000000111101000at 16 bits, every bit flipped
Bits reversed1110100001111111at 16 bits
Rotated left by 11111110000101111at 16 bits, wrapping
Shifted left by 1-1111010010= -978, no wrap
Shifted right by 1-11110101= -244, discarding the low bit
These bits as a double2.41598101 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+491
Nearest square below484
Nearest square above529

Powers & multiples

-489 to the power 2239,121
-489 to the power 3-116,930,169
-489 to the power 457,178,852,641
-489 to the power 5-27,960,458,941,449
First ten multiples-489, -978, -1,467, -1,956, -2,445, -2,934, -3,423, -3,912, -4,401, -4,890
Powers of twoBetween 2^8 (256) and 2^9 (512)

Divisibility tests

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

As a percentage & fraction

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