Recognised as Number
-489,704
- Negative
- Even
- 6 digits
-489,704 is an even 6-digit integer and the negative of 489,704. It has 16 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value489,704
Digit count6
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^3 × 41 × 1,493
Distinct prime factors32, 41, 1,493
Number of divisors16
Sum of divisors σ(n)941,220
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 41, 82, 164, 328, 1,493, 2,986, 5,972, 11,944, 61,213, 122,426, 244,852, 489,70416 in total
Arithmetic
Representations
Decimal-489,704
Binary111011110001110100019 bits
Octal1674350
Hexadecimal778E8
Base 36AHUW
In wordsminus four hundred and eighty-nine thousand, seven hundred and four
Ordinalminus four hundred and eighty-nine thousand, seven hundred and fourth
Scientific notation-4.89704 × 10^5
Engineering notation-489.704 × 10^3
In other bases
Ternary220212202012base 3; the most digit-efficient integer base after e: 12 digits
Quinary111132304base 5; one hand: 9 digits
Septenary4106465base 7: 7 digits
Nonary825665base 9; each digit is two ternary digits: 6 digits
Duodecimal1b7488base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal31454base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal2:16:1:44base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT01T0101T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011001101101101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110001000011100011000
Bit length19 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits8within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes307 78 e8
Gray code1001100010010011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110001000011100011000two's complement
64-bit1111111111111111111111111111111111111111111110001000011100011000two's complement
One's complement00000000000001110111100011100111at 32 bits, every bit flipped
Bits reversed00011000111000010001111111111111at 32 bits
Rotated left by 111111111111100010000111000110001at 32 bits, wrapping
Shifted left by 1-11101111000111010000= -979,408, no wrap
Shifted right by 1-111011110001110100= -244,852, discarding the low bit
These bits as a double2.41945923 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-489,704 to the power 2239,810,007,616
-489,704 to the power 3-117,435,919,969,585,664
-489,704 to the power 457,508,839,752,785,978,003,456
-489,704 to the power 5-28,162,308,862,298,304,572,204,417,024
First ten multiples-489,704, -979,408, -1,469,112, -1,958,816, -2,448,520, -2,938,224, -3,427,928, -3,917,632, -4,407,336, -4,897,040
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 5
Divisible by 10No, remainder 4
Divisible by 11No, remainder 6
Divisible by 12No, remainder 8
Divisible by 100No, remainder 4
As a percentage & fraction
As a percentage-48,970,400%
-489,704% as a decimal-4,897.04
-489,704% of 100-489,704
-489,704% of 1,000-4,897,040
As a fraction of 100-489,704/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -489,704
Nerdulate something else
Nothing in mind? Surprise me · today’s page