Recognised as Number
-202,009
- Negative
- Odd
- 6 digits
-202,009 is an odd 6-digit integer and the negative of 202,009. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value202,009
Digit count6
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 23 × 8,783
Distinct prime factors223, 8,783
Number of divisors4
Sum of divisors σ(n)210,816
SquarefreeYesno repeated prime factor
All divisors1, 23, 8,783, 202,0094 in total
Arithmetic
Previous number-202,010
Next number-202,008
Double-404,018
Half-101,004.5
Square40,807,636,081
Cube-8,243,509,757,086,729
Cube root-58.675514477≈
Negation202,009
Reciprocal-0.0000049503≈
Representations
Decimal-202,009
Binary11000101010001100118 bits
Octal612431
Hexadecimal31519
Base 364BVD
In wordsminus two hundred and two thousand and nine
Ordinalminus two hundred and two thousand and ninth
Scientific notation-2.02009 × 10^5
Engineering notation-202.009 × 10^3
In other bases
Ternary101021002211base 3; the most digit-efficient integer base after e: 12 digits
Quinary22431014base 5; one hand: 8 digits
Septenary1500643base 7: 7 digits
Nonary337084base 9; each digit is two ternary digits: 6 digits
Duodecimal98aa1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal15509base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal56:6:49base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0TT1T0T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011111100111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001110101011100111
Bit length18 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits10within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes303 15 19
Gray code101001111110010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001110101011100111two's complement
64-bit1111111111111111111111111111111111111111111111001110101011100111two's complement
One's complement00000000000000110001010100011000at 32 bits, every bit flipped
Bits reversed11100111010101110011111111111111at 32 bits
Rotated left by 111111111111110011101010111001111at 32 bits, wrapping
Shifted left by 1-1100010101000110010= -404,018, no wrap
Shifted right by 1-11000101010001101= -101,004, discarding the low bit
These bits as a double9.98057071 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-202,009 to the power 240,807,636,081
-202,009 to the power 3-8,243,509,757,086,729
-202,009 to the power 41,665,263,162,519,333,038,561
-202,009 to the power 5-336,398,146,197,367,947,786,669,049
First ten multiples-202,009, -404,018, -606,027, -808,036, -1,010,045, -1,212,054, -1,414,063, -1,616,072, -1,818,081, -2,020,090
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-20,200,900%
-202,009% as a decimal-2,020.09
-202,009% of 100-202,009
-202,009% of 1,000-2,020,090
As a fraction of 100-202,009/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -202,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page