Recognised as Number
-200,033
- Negative
- Odd
- 6 digits
-200,033 is an odd 6-digit integer and the negative of 200,033. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value200,033
Digit count6
Digit sum8
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 200,033
Distinct prime factors1200,033
Number of divisors2
Sum of divisors σ(n)200,034
SquarefreeYesno repeated prime factor
All divisors1, 200,0332 in total
Arithmetic
Previous number-200,034
Next number-200,032
Double-400,066
Half-100,016.5
Square40,013,201,089
Cube-8,003,960,653,435,937
Cube root-58.483571007≈
Negation200,033
Reciprocal-0.0000049992≈
Representations
Decimal-200,033
Binary11000011010110000118 bits
Octal606541
Hexadecimal30D61
Base 364ACH
In wordsminus two hundred thousand and thirty-three
Ordinalminus two hundred thousand and thirty-third
Scientific notation-2.00033 × 10^5
Engineering notation-200.033 × 10^3
In other bases
Ternary101011101122base 3; the most digit-efficient integer base after e: 12 digits
Quinary22400113base 5; one hand: 8 digits
Septenary1462121base 7: 7 digits
Nonary334348base 9; each digit is two ternary digits: 6 digits
Duodecimal97915base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal1501dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal55:33:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T0TTTT1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011011111100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001111001010011111
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 0d 61
Gray code101000101111010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001111001010011111two's complement
64-bit1111111111111111111111111111111111111111111111001111001010011111two's complement
One's complement00000000000000110000110101100000at 32 bits, every bit flipped
Bits reversed11111001010011110011111111111111at 32 bits
Rotated left by 111111111111110011110010100111111at 32 bits, wrapping
Shifted left by 1-1100001101011000010= -400,066, no wrap
Shifted right by 1-11000011010110001= -100,016, discarding the low bit
These bits as a double9.88294333 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-200,033 to the power 240,013,201,089
-200,033 to the power 3-8,003,960,653,435,937
-200,033 to the power 41,601,056,261,388,750,785,921
-200,033 to the power 5-320,264,087,134,375,985,960,135,393
First ten multiples-200,033, -400,066, -600,099, -800,132, -1,000,165, -1,200,198, -1,400,231, -1,600,264, -1,800,297, -2,000,330
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
As a percentage & fraction
As a percentage-20,003,300%
-200,033% as a decimal-2,000.33
-200,033% of 100-200,033
-200,033% of 1,000-2,000,330
As a fraction of 100-200,033/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -200,033
Nerdulate something else
Nothing in mind? Surprise me · today’s page