Recognised as Number
-7,095
- Negative
- Odd
- 4 digits
-7,095 is an odd 4-digit integer and the negative of 7,095. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value7,095
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 × 5 × 11 × 43
Distinct prime factors43, 5, 11, 43
Number of divisors16
Sum of divisors σ(n)12,672
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 11, 15, 33, 43, 55, 129, 165, 215, 473, 645, 1,419, 2,365, 7,09516 in total
Arithmetic
Previous number-7,096
Next number-7,094
Double-14,190
Half-3,547.5
Square50,339,025
Cube-357,155,382,375
Cube root-19.215460637≈
Negation7,095
Reciprocal-0.0001409443≈
Representations
Decimal-7,095
Binary110111011011113 bits
Octal15667
Hexadecimal1BB7
Base 365H3
In wordsminus seven thousand and ninety-five
Ordinalminus seven thousand and ninety-fifth
Scientific notation-7.095 × 10^3
Engineering notation-7.095 × 10^3
In other bases
Ternary100201210base 3; the most digit-efficient integer base after e: 9 digits
Quinary211340base 5; one hand: 6 digits
Septenary26454base 7: 5 digits
Nonary10653base 9; each digit is two ternary digits: 5 digits
Duodecimal4133base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalhefbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:58:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T1T11T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010001011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110010001001001
Bit length13 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits3within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes21b b7
Gray code1011001101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110010001001001two's complement
32-bit11111111111111111110010001001001two's complement
64-bit1111111111111111111111111111111111111111111111111110010001001001two's complement
One's complement0001101110110110at 16 bits, every bit flipped
Bits reversed1001001000100111at 16 bits
Rotated left by 11100100010010011at 16 bits, wrapping
Shifted left by 1-11011101101110= -14,190, no wrap
Shifted right by 1-110111011100= -3,547, discarding the low bit
These bits as a double3.50539576 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-7,095 to the power 250,339,025
-7,095 to the power 3-357,155,382,375
-7,095 to the power 42,534,017,437,950,625
-7,095 to the power 5-17,978,853,722,259,684,375
First ten multiples-7,095, -14,190, -21,285, -28,380, -35,475, -42,570, -49,665, -56,760, -63,855, -70,950
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 95
As a percentage & fraction
As a percentage-709,500%
-7,095% as a decimal-70.95
-7,095% of 100-7,095
-7,095% of 1,000-70,950
As a fraction of 100-7,095/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -7,095
Nerdulate something else
Nothing in mind? Surprise me · today’s page