Recognised as Number
-17,621
- Negative
- Odd
- 5 digits
-17,621 is an odd 5-digit integer and the negative of 17,621. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value17,621
Digit count5
Digit sum17
Digit product84
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 67 × 263
Distinct prime factors267, 263
Number of divisors4
Sum of divisors σ(n)17,952
SquarefreeYesno repeated prime factor
All divisors1, 67, 263, 17,6214 in total
Arithmetic
Representations
Decimal-17,621
Binary10001001101010115 bits
Octal42325
Hexadecimal44D5
Base 36DLH
In wordsminus seventeen thousand, six hundred and twenty-one
Ordinalminus seventeen thousand, six hundred and twenty-first
Scientific notation-1.7621 × 10^4
Engineering notation-17.621 × 10^3
In other bases
Ternary220011122base 3; the most digit-efficient integer base after e: 9 digits
Quinary1030441base 5; one hand: 7 digits
Septenary102242base 7: 6 digits
Nonary26148base 9; each digit is two ternary digits: 5 digits
Duodecimala245base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal2411base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:53:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT010T11101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111101111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1011101100101011
Bit length15 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits8within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes244 d5
Gray code110011010111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1011101100101011two's complement
32-bit11111111111111111011101100101011two's complement
64-bit1111111111111111111111111111111111111111111111111011101100101011two's complement
One's complement0100010011010100at 16 bits, every bit flipped
Bits reversed1101010011011101at 16 bits
Rotated left by 10111011001010111at 16 bits, wrapping
Shifted left by 1-1000100110101010= -35,242, no wrap
Shifted right by 1-10001001101011= -8,810, discarding the low bit
These bits as a double8.70593075 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-17,621 to the power 2310,499,641
-17,621 to the power 3-5,471,314,174,061
-17,621 to the power 496,410,027,061,128,881
-17,621 to the power 5-1,698,841,086,844,152,012,101
First ten multiples-17,621, -35,242, -52,863, -70,484, -88,105, -105,726, -123,347, -140,968, -158,589, -176,210
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-1,762,100%
-17,621% as a decimal-176.21
-17,621% of 100-17,621
-17,621% of 1,000-176,210
As a fraction of 100-17,621/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -17,621
Nerdulate something else
Nothing in mind? Surprise me · today’s page