Recognised as Number
-2,047
- Negative
- Odd
- 4 digits
-2,047 is an odd 4-digit integer and the negative of 2,047. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value2,047
Digit count4
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 23 × 89
Distinct prime factors223, 89
Number of divisors4
Sum of divisors σ(n)2,160
SquarefreeYesno repeated prime factor
All divisors1, 23, 89, 2,0474 in total
Arithmetic
Representations
Decimal-2,047
Binary1111111111111 bits
Octal3777
Hexadecimal7FF
Base 361KV
In wordsminus two thousand and forty-seven
Ordinalminus two thousand and forty-seventh
Scientific notation-2.047 × 10^3
Engineering notation-2.047 × 10^3
In other bases
Ternary2210211base 3; the most digit-efficient integer base after e: 7 digits
Quinary31142base 5; one hand: 5 digits
Septenary5653base 7: 4 digits
Nonary2724base 9; each digit is two ternary digits: 4 digits
Duodecimal1227base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal527base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal34:7base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT01TT1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111100000000001
Bit length11 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits0within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 10worth 1,024
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes207 ff
Gray code10000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111100000000001two's complement
32-bit11111111111111111111100000000001two's complement
64-bit1111111111111111111111111111111111111111111111111111100000000001two's complement
One's complement0000011111111110at 16 bits, every bit flipped
Bits reversed1000000000011111at 16 bits
Rotated left by 11111000000000011at 16 bits, wrapping
Shifted left by 1-111111111110= -4,094, no wrap
Shifted right by 1-10000000000= -1,023, discarding the low bit
These bits as a double1.01135238 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,047 to the power 24,190,209
-2,047 to the power 3-8,577,357,823
-2,047 to the power 417,557,851,463,681
-2,047 to the power 5-35,940,921,946,155,007
First ten multiples-2,047, -4,094, -6,141, -8,188, -10,235, -12,282, -14,329, -16,376, -18,423, -20,470
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
As a percentage & fraction
As a percentage-204,700%
-2,047% as a decimal-20.47
-2,047% of 100-2,047
-2,047% of 1,000-20,470
As a fraction of 100-2,047/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,047
Nerdulate something else
Nothing in mind? Surprise me · today’s page