Recognised as Number
-171,201
- Negative
- Odd
- 6 digits
-171,201 is an odd 6-digit integer and the negative of 171,201. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value171,201
Digit count6
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 149 × 383
Distinct prime factors33, 149, 383
Number of divisors8
Sum of divisors σ(n)230,400
SquarefreeYesno repeated prime factor
All divisors1, 3, 149, 383, 447, 1,149, 57,067, 171,2018 in total
Arithmetic
Representations
Decimal-171,201
Binary10100111001100000118 bits
Octal516301
Hexadecimal29CC1
Base 363O3L
In wordsminus one hundred and seventy-one thousand, two hundred and one
Ordinalminus one hundred and seventy-one thousand, two hundred and first
Scientific notation-1.71201 × 10^5
Engineering notation-171.201 × 10^3
In other bases
Ternary22200211210base 3; the most digit-efficient integer base after e: 11 digits
Quinary20434301base 5; one hand: 8 digits
Septenary1312062base 7: 7 digits
Nonary280753base 9; each digit is two ternary digits: 6 digits
Duodecimal830a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal11801base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal47:33:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0010T0111T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010011101000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111010110001100111111
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
Bytes302 9c c1
Gray code111101001010100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111010110001100111111two's complement
64-bit1111111111111111111111111111111111111111111111010110001100111111two's complement
One's complement00000000000000101001110011000000at 32 bits, every bit flipped
Bits reversed11111100110001101011111111111111at 32 bits
Rotated left by 111111111111110101100011001111111at 32 bits, wrapping
Shifted left by 1-1010011100110000010= -342,402, no wrap
Shifted right by 1-10100111001100001= -85,600, discarding the low bit
These bits as a double8.45845326 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-171,201 to the power 229,309,782,401
-171,201 to the power 3-5,017,864,056,833,601
-171,201 to the power 4859,063,344,393,969,324,801
-171,201 to the power 5-147,072,503,623,591,942,375,256,001
First ten multiples-171,201, -342,402, -513,603, -684,804, -856,005, -1,027,206, -1,198,407, -1,369,608, -1,540,809, -1,712,010
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-17,120,100%
-171,201% as a decimal-1,712.01
-171,201% of 100-171,201
-171,201% of 1,000-1,712,010
As a fraction of 100-171,201/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -171,201
Nerdulate something else
Nothing in mind? Surprise me · today’s page