Recognised as Number
-17,683
- Negative
- Odd
- 5 digits
-17,683 is an odd 5-digit integer and the negative of 17,683. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value17,683
Digit count5
Digit sum25
Digit product1,008
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 17,683
Distinct prime factors117,683
Number of divisors2
Sum of divisors σ(n)17,684
SquarefreeYesno repeated prime factor
All divisors1, 17,6832 in total
Arithmetic
Representations
Decimal-17,683
Binary10001010001001115 bits
Octal42423
Hexadecimal4513
Base 36DN7
In wordsminus seventeen thousand, six hundred and eighty-three
Ordinalminus seventeen thousand, six hundred and eighty-third
Scientific notation-1.7683 × 10^4
Engineering notation-17.683 × 10^3
In other bases
Ternary220020221base 3; the most digit-efficient integer base after e: 9 digits
Quinary1031213base 5; one hand: 7 digits
Septenary102361base 7: 6 digits
Nonary26227base 9; each digit is two ternary digits: 5 digits
Duodecimala297base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal2443base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:54:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT010T1T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111100111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1011101011101101
Bit length15 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits9within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes245 13
Gray code110011110011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1011101011101101two's complement
32-bit11111111111111111011101011101101two's complement
64-bit1111111111111111111111111111111111111111111111111011101011101101two's complement
One's complement0100010100010010at 16 bits, every bit flipped
Bits reversed1011011101011101at 16 bits
Rotated left by 10111010111011011at 16 bits, wrapping
Shifted left by 1-1000101000100110= -35,366, no wrap
Shifted right by 1-10001010001010= -8,841, discarding the low bit
These bits as a double8.73656282 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-17,683 to the power 2312,688,489
-17,683 to the power 3-5,529,270,550,987
-17,683 to the power 497,774,091,153,103,121
-17,683 to the power 5-1,728,939,253,860,322,488,643
First ten multiples-17,683, -35,366, -53,049, -70,732, -88,415, -106,098, -123,781, -141,464, -159,147, -176,830
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 83
As a percentage & fraction
As a percentage-1,768,300%
-17,683% as a decimal-176.83
-17,683% of 100-17,683
-17,683% of 1,000-176,830
As a fraction of 100-17,683/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -17,683
Nerdulate something else
Nothing in mind? Surprise me · today’s page