Nerdulator> put something in

Recognised as Number

-7,097

  • Negative
  • Odd
  • 4 digits

-7,097 is an odd 4-digit integer and the negative of 7,097. It has 4 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value7,097
Digit count4
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 47 × 151
Distinct prime factors247, 151
Number of divisors4
Sum of divisors σ(n)7,296
SquarefreeYesno repeated prime factor
All divisors1, 47, 151, 7,0974 in total

Arithmetic

Previous number-7,098
Next number-7,096
Double-14,194
Cube root-19.217266008
Negation7,097
Reciprocal-0.0001409046

Representations

Decimal-7,097
Binary110111011100113 bits
Octal15671
Hexadecimal1BB9
Base 365H5
In wordsminus seven thousand and ninety-seven
Ordinalminus seven thousand and ninety-seventh
Scientific notation-7.097 × 10^3
Engineering notation-7.097 × 10^3

In other bases

Ternary100201212base 3; the most digit-efficient integer base after e: 9 digits
Quinary211342base 5; one hand: 6 digits
Septenary26456base 7: 5 digits
Nonary10655base 9; each digit is two ternary digits: 5 digits
Duodecimal4135base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalhehbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:58:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T1T1011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010001011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110010001000111
Bit length13 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits4within that length
Bit parityodd9 set bits, so odd; 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 b9
Gray code1011001100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110010001000111two's complement
32-bit11111111111111111110010001000111two's complement
64-bit1111111111111111111111111111111111111111111111111110010001000111two's complement
One's complement0001101110111000at 16 bits, every bit flipped
Bits reversed1110001000100111at 16 bits
Rotated left by 11100100010001111at 16 bits, wrapping
Shifted left by 1-11011101110010= -14,194, no wrap
Shifted right by 1-110111011101= -3,548, discarding the low bit
These bits as a double3.50638389 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+7,099
Nearest square below7,056
Nearest square above7,225

Powers & multiples

-7,097 to the power 250,367,409
-7,097 to the power 3-357,457,501,673
-7,097 to the power 42,536,875,889,373,281
-7,097 to the power 5-18,004,208,186,882,175,257
First ten multiples-7,097, -14,194, -21,291, -28,388, -35,485, -42,582, -49,679, -56,776, -63,873, -70,970
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97

As a percentage & fraction

As a percentage-709,700%
-7,097% as a decimal-70.97
-7,097% of 100-7,097
-7,097% of 1,000-70,970
As a fraction of 100-7,097/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “-7097” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.