Nerdulator> put something in

Recognised as Number

-2,072

  • Negative
  • Even
  • 4 digits

-2,072 is an even 4-digit integer and the negative of 2,072. It has 16 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value2,072
Digit count4
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2^3 × 7 × 37
Distinct prime factors32, 7, 37
Number of divisors16
Sum of divisors σ(n)4,560
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 28, 37, 56, 74, 148, 259, 296, 518, 1,036, 2,07216 in total

Arithmetic

Previous number-2,073
Next number-2,071
Double-4,144
Half-1,036
Square4,293,184
Cube root-12.748622176
Negation2,072
Reciprocal-0.0004826255

Representations

Decimal-2,072
Binary10000001100012 bits
Octal4030
Hexadecimal818
Base 361LK
In wordsminus two thousand and seventy-two
Ordinalminus two thousand and seventy-second
Scientific notation-2.072 × 10^3
Engineering notation-2.072 × 10^3

In other bases

Ternary2211202base 3; the most digit-efficient integer base after e: 7 digits
Quinary31242base 5; one hand: 5 digits
Septenary6020base 7: 4 digits
Nonary2752base 9; each digit is two ternary digits: 4 digits
Duodecimal1248base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal53cbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal34:32base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT00111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111011111101000
Bit length12 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits9within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being even
Highest set bitbit 11worth 2,048
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes208 18
Gray code110000010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111011111101000two's complement
32-bit11111111111111111111011111101000two's complement
64-bit1111111111111111111111111111111111111111111111111111011111101000two's complement
One's complement0000100000010111at 16 bits, every bit flipped
Bits reversed0001011111101111at 16 bits
Rotated left by 11110111111010001at 16 bits, wrapping
Shifted left by 1-1000000110000= -4,144, no wrap
Shifted right by 1-10000001100= -1,036, discarding the low bit
These bits as a double1.02370402 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+2,074
Nearest square below2,025
Nearest square above2,116

Powers & multiples

-2,072 to the power 24,293,184
-2,072 to the power 3-8,895,477,248
-2,072 to the power 418,431,428,857,856
-2,072 to the power 5-38,189,920,593,477,632
First ten multiples-2,072, -4,144, -6,216, -8,288, -10,360, -12,432, -14,504, -16,576, -18,648, -20,720
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)

Divisibility tests

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

As a percentage & fraction

As a percentage-207,200%
-2,072% as a decimal-20.72
-2,072% of 100-2,072
-2,072% of 1,000-20,720
As a fraction of 100-2,072/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 “-2072” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.