Recognised as Number
-28,003
- Negative
- Odd
- 5 digits
-28,003 is an odd 5-digit integer and the negative of 28,003. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value28,003
Digit count5
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 41 × 683
Distinct prime factors241, 683
Number of divisors4
Sum of divisors σ(n)28,728
SquarefreeYesno repeated prime factor
All divisors1, 41, 683, 28,0034 in total
Arithmetic
Representations
Decimal-28,003
Binary11011010110001115 bits
Octal66543
Hexadecimal6D63
Base 36LLV
In wordsminus twenty-eight thousand and three
Ordinalminus twenty-eight thousand and third
Scientific notation-2.8003 × 10^4
Engineering notation-28.003 × 10^3
In other bases
Ternary1102102011base 3; the most digit-efficient integer base after e: 10 digits
Quinary1344003base 5; one hand: 7 digits
Septenary144433base 7: 6 digits
Nonary42364base 9; each digit is two ternary digits: 5 digits
Duodecimal14257base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3a03base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:46:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTTT1TT10TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001011111101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001001010011101
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 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
Bytes26d 63
Gray code101101111010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001001010011101two's complement
32-bit11111111111111111001001010011101two's complement
64-bit1111111111111111111111111111111111111111111111111001001010011101two's complement
One's complement0110110101100010at 16 bits, every bit flipped
Bits reversed1011100101001001at 16 bits
Rotated left by 10010010100111011at 16 bits, wrapping
Shifted left by 1-1101101011000110= -56,006, no wrap
Shifted right by 1-11011010110010= -14,001, discarding the low bit
These bits as a double1.38353203 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-28,003 to the power 2784,168,009
-28,003 to the power 3-21,959,056,756,027
-28,003 to the power 4614,919,466,339,024,081
-28,003 to the power 5-17,219,589,815,891,691,340,243
First ten multiples-28,003, -56,006, -84,009, -112,012, -140,015, -168,018, -196,021, -224,024, -252,027, -280,030
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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 3
As a percentage & fraction
As a percentage-2,800,300%
-28,003% as a decimal-280.03
-28,003% of 100-28,003
-28,003% of 1,000-280,030
As a fraction of 100-28,003/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -28,003
Nerdulate something else
Nothing in mind? Surprise me · today’s page