Recognised as Number
-10,563
- Negative
- Odd
- 5 digits
-10,563 is an odd 5-digit integer and the negative of 10,563. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,563
Digit count5
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7 × 503
Distinct prime factors33, 7, 503
Number of divisors8
Sum of divisors σ(n)16,128
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 503, 1,509, 3,521, 10,5638 in total
Arithmetic
Representations
Decimal-10,563
Binary1010010100001114 bits
Octal24503
Hexadecimal2943
Base 3685F
In wordsminus ten thousand, five hundred and sixty-three
Ordinalminus ten thousand, five hundred and sixty-third
Scientific notation-1.0563 × 10^4
Engineering notation-10.563 × 10^3
In other bases
Ternary112111020base 3; the most digit-efficient integer base after e: 9 digits
Quinary314223base 5; one hand: 6 digits
Septenary42540base 7: 5 digits
Nonary15436base 9; each digit is two ternary digits: 5 digits
Duodecimal6143base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1683base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:56:3base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111TTTT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101111001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101011010111101
Bit length14 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits8within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes229 43
Gray code11110111100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101011010111101two's complement
32-bit11111111111111111101011010111101two's complement
64-bit1111111111111111111111111111111111111111111111111101011010111101two's complement
One's complement0010100101000010at 16 bits, every bit flipped
Bits reversed1011110101101011at 16 bits
Rotated left by 11010110101111011at 16 bits, wrapping
Shifted left by 1-101001010000110= -21,126, no wrap
Shifted right by 1-1010010100010= -5,281, discarding the low bit
These bits as a double5.21881542 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-10,563 to the power 2111,576,969
-10,563 to the power 3-1,178,587,523,547
-10,563 to the power 412,449,420,011,226,961
-10,563 to the power 5-131,503,223,578,590,389,043
First ten multiples-10,563, -21,126, -31,689, -42,252, -52,815, -63,378, -73,941, -84,504, -95,067, -105,630
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 63
As a percentage & fraction
As a percentage-1,056,300%
-10,563% as a decimal-105.63
-10,563% of 100-10,563
-10,563% of 1,000-105,630
As a fraction of 100-10,563/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -10,563
Nerdulate something else
Nothing in mind? Surprise me · today’s page