Recognised as Number
-201,007
- Negative
- Odd
- 6 digits
-201,007 is an odd 6-digit integer and the negative of 201,007. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value201,007
Digit count6
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 201,007
Distinct prime factors1201,007
Number of divisors2
Sum of divisors σ(n)201,008
SquarefreeYesno repeated prime factor
All divisors1, 201,0072 in total
Arithmetic
Previous number-201,008
Next number-201,006
Double-402,014
Half-100,503.5
Square40,403,814,049
Cube-8,121,449,450,547,343
Cube root-58.578340025≈
Negation201,007
Reciprocal-0.000004975≈
Representations
Decimal-201,007
Binary11000100010010111118 bits
Octal610457
Hexadecimal3112F
Base 364B3J
In wordsminus two hundred and one thousand and seven
Ordinalminus two hundred and one thousand and seventh
Scientific notation-2.01007 × 10^5
Engineering notation-201.007 × 10^3
In other bases
Ternary101012201201base 3; the most digit-efficient integer base after e: 12 digits
Quinary22413012base 5; one hand: 8 digits
Septenary1465012base 7: 7 digits
Nonary335651base 9; each digit is two ternary digits: 6 digits
Duodecimal983a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal152a7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal55:50:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0TT101T110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011001111010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001110111011010001
Bit length18 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits9within that length
Bit parityodd9 set bits, so odd; 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 11 2f
Gray code101001100110111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001110111011010001two's complement
64-bit1111111111111111111111111111111111111111111111001110111011010001two's complement
One's complement00000000000000110001000100101110at 32 bits, every bit flipped
Bits reversed10001011011101110011111111111111at 32 bits
Rotated left by 111111111111110011101110110100011at 32 bits, wrapping
Shifted left by 1-1100010001001011110= -402,014, no wrap
Shifted right by 1-11000100010011000= -100,503, discarding the low bit
These bits as a double9.93106533 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-201,007 to the power 240,403,814,049
-201,007 to the power 3-8,121,449,450,547,343
-201,007 to the power 41,632,468,189,706,169,774,401
-201,007 to the power 5-328,137,533,408,268,067,843,021,807
First ten multiples-201,007, -402,014, -603,021, -804,028, -1,005,035, -1,206,042, -1,407,049, -1,608,056, -1,809,063, -2,010,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-20,100,700%
-201,007% as a decimal-2,010.07
-201,007% of 100-201,007
-201,007% of 1,000-2,010,070
As a fraction of 100-201,007/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -201,007
Nerdulate something else
Nothing in mind? Surprise me · today’s page