Recognised as Number
-9,507
- Negative
- Odd
- 4 digits
-9,507 is an odd 4-digit integer and the negative of 9,507. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value9,507
Digit count4
Digit sum21
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 × 3,169
Distinct prime factors23, 3,169
Number of divisors4
Sum of divisors σ(n)12,680
SquarefreeYesno repeated prime factor
All divisors1, 3, 3,169, 9,5074 in total
Arithmetic
Previous number-9,508
Next number-9,506
Double-19,014
Half-4,753.5
Square90,383,049
Cube-859,271,646,843
Cube root-21.184318533≈
Negation9,507
Reciprocal-0.0001051857≈
Representations
Decimal-9,507
Binary1001010010001114 bits
Octal22443
Hexadecimal2523
Base 367C3
In wordsminus nine thousand, five hundred and seven
Ordinalminus nine thousand, five hundred and seventh
Scientific notation-9.507 × 10^3
Engineering notation-9.507 × 10^3
In other bases
Ternary111001010base 3; the most digit-efficient integer base after e: 9 digits
Quinary301012base 5; one hand: 6 digits
Septenary36501base 7: 5 digits
Nonary14033base 9; each digit is two ternary digits: 5 digits
Duodecimal5603base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal13f7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:38:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTTT00T0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111100101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101101011011101
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
Bytes225 23
Gray code11011110110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101101011011101two's complement
32-bit11111111111111111101101011011101two's complement
64-bit1111111111111111111111111111111111111111111111111101101011011101two's complement
One's complement0010010100100010at 16 bits, every bit flipped
Bits reversed1011101101011011at 16 bits
Rotated left by 11011010110111011at 16 bits, wrapping
Shifted left by 1-100101001000110= -19,014, no wrap
Shifted right by 1-1001010010010= -4,753, discarding the low bit
These bits as a double4.6970821 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-9,507 to the power 290,383,049
-9,507 to the power 3-859,271,646,843
-9,507 to the power 48,169,095,546,536,401
-9,507 to the power 5-77,663,591,360,921,564,307
First ten multiples-9,507, -19,014, -28,521, -38,028, -47,535, -57,042, -66,549, -76,056, -85,563, -95,070
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-950,700%
-9,507% as a decimal-95.07
-9,507% of 100-9,507
-9,507% of 1,000-95,070
As a fraction of 100-9,507/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -9,507
Nerdulate something else
Nothing in mind? Surprise me · today’s page