Recognised as Number
-3,026
- Negative
- Even
- 4 digits
-3,026 is an even 4-digit integer and the negative of 3,026. It has 8 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value3,026
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 × 17 × 89
Distinct prime factors32, 17, 89
Number of divisors8
Sum of divisors σ(n)4,860
SquarefreeYesno repeated prime factor
All divisors1, 2, 17, 34, 89, 178, 1,513, 3,0268 in total
Arithmetic
Representations
Decimal-3,026
Binary10111101001012 bits
Octal5722
HexadecimalBD2
Base 362C2
In wordsminus three thousand and twenty-six
Ordinalminus three thousand and twenty-sixth
Scientific notation-3.026 × 10^3
Engineering notation-3.026 × 10^3
In other bases
Ternary11011002base 3; the most digit-efficient integer base after e: 8 digits
Quinary44101base 5; one hand: 5 digits
Septenary11552base 7: 5 digits
Nonary4132base 9; each digit is two ternary digits: 4 digits
Duodecimal1902base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal7b6base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal50:26base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTT0TT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111010000101110
Bit length12 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits5within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 11worth 2,048
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes20b d2
Gray code111000111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111010000101110two's complement
32-bit11111111111111111111010000101110two's complement
64-bit1111111111111111111111111111111111111111111111111111010000101110two's complement
One's complement0000101111010001at 16 bits, every bit flipped
Bits reversed0111010000101111at 16 bits
Rotated left by 11110100001011101at 16 bits, wrapping
Shifted left by 1-1011110100100= -6,052, no wrap
Shifted right by 1-10111101001= -1,513, discarding the low bit
These bits as a double1.49504264 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,026 to the power 29,156,676
-3,026 to the power 3-27,708,101,576
-3,026 to the power 483,844,715,368,976
-3,026 to the power 5-253,714,108,706,521,376
First ten multiples-3,026, -6,052, -9,078, -12,104, -15,130, -18,156, -21,182, -24,208, -27,234, -30,260
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 6
Divisible by 11No, remainder 1
Divisible by 12No, remainder 2
Divisible by 100No, remainder 26
As a percentage & fraction
As a percentage-302,600%
-3,026% as a decimal-30.26
-3,026% of 100-3,026
-3,026% of 1,000-30,260
As a fraction of 100-3,026/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,026
Nerdulate something else
Nothing in mind? Surprise me · today’s page