Recognised as Number
-490,052
- Negative
- Even
- 6 digits
-490,052 is an even 6-digit integer and the negative of 490,052. It has 12 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value490,052
Digit count6
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 101 × 1,213
Distinct prime factors32, 101, 1,213
Number of divisors12
Sum of divisors σ(n)866,796
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 101, 202, 404, 1,213, 2,426, 4,852, 122,513, 245,026, 490,05212 in total
Arithmetic
Representations
Decimal-490,052
Binary111011110100100010019 bits
Octal1675104
Hexadecimal77A44
Base 36AI4K
In wordsminus four hundred and ninety thousand and fifty-two
Ordinalminus four hundred and ninety thousand and fifty-second
Scientific notation-4.90052 × 10^5
Engineering notation-490.052 × 10^3
In other bases
Ternary220220020002base 3; the most digit-efficient integer base after e: 12 digits
Quinary111140202base 5; one hand: 9 digits
Septenary4110503base 7: 7 digits
Nonary826202base 9; each digit is two ternary digits: 6 digits
Duodecimal1b7718base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal3152cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal2:16:7:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT01T010T100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011001101011001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110001000010110111100
Bit length19 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits9within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes307 7a 44
Gray code1001100011101100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110001000010110111100two's complement
64-bit1111111111111111111111111111111111111111111110001000010110111100two's complement
One's complement00000000000001110111101001000011at 32 bits, every bit flipped
Bits reversed00111101101000010001111111111111at 32 bits
Rotated left by 111111111111100010000101101111001at 32 bits, wrapping
Shifted left by 1-11101111010010001000= -980,104, no wrap
Shifted right by 1-111011110100100010= -245,026, discarding the low bit
These bits as a double2.42117858 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-490,052 to the power 2240,150,962,704
-490,052 to the power 3-117,686,459,575,020,608
-490,052 to the power 457,672,484,887,657,998,991,616
-490,052 to the power 5-28,262,516,564,166,577,721,839,404,032
First ten multiples-490,052, -980,104, -1,470,156, -1,960,208, -2,450,260, -2,940,312, -3,430,364, -3,920,416, -4,410,468, -4,900,520
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 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 8
Divisible by 100No, remainder 52
As a percentage & fraction
As a percentage-49,005,200%
-490,052% as a decimal-4,900.52
-490,052% of 100-490,052
-490,052% of 1,000-4,900,520
As a fraction of 100-490,052/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -490,052
Nerdulate something else
Nothing in mind? Surprise me · today’s page