Recognised as Number
-3,050
- Negative
- Even
- 4 digits
-3,050 is an even 4-digit integer and the negative of 3,050. It has 12 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value3,050
Digit count4
Digit sum8
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5^2 × 61
Distinct prime factors32, 5, 61
Number of divisors12
Sum of divisors σ(n)5,766
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 10, 25, 50, 61, 122, 305, 610, 1,525, 3,05012 in total
Arithmetic
Representations
Decimal-3,050
Binary10111110101012 bits
Octal5752
HexadecimalBEA
Base 362CQ
In wordsminus three thousand and fifty
Ordinalminus three thousand and fiftieth
Scientific notation-3.05 × 10^3
Engineering notation-3.05 × 10^3
In other bases
Ternary11011222base 3; the most digit-efficient integer base after e: 8 digits
Quinary44200base 5; one hand: 5 digits
Septenary11615base 7: 5 digits
Nonary4158base 9; each digit is two ternary digits: 4 digits
Duodecimal1922base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal7cabase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal50:50base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTTT11001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111010000010110
Bit length12 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits4within that length
Bit parityeven8 set bits, so even; 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 ea
Gray code111000011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111010000010110two's complement
32-bit11111111111111111111010000010110two's complement
64-bit1111111111111111111111111111111111111111111111111111010000010110two's complement
One's complement0000101111101001at 16 bits, every bit flipped
Bits reversed0110100000101111at 16 bits
Rotated left by 11110100000101101at 16 bits, wrapping
Shifted left by 1-1011111010100= -6,100, no wrap
Shifted right by 1-10111110101= -1,525, discarding the low bit
These bits as a double1.50690022 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,050 to the power 29,302,500
-3,050 to the power 3-28,372,625,000
-3,050 to the power 486,536,506,250,000
-3,050 to the power 5-263,936,344,062,500,000
First ten multiples-3,050, -6,100, -9,150, -12,200, -15,250, -18,300, -21,350, -24,400, -27,450, -30,500
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 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10Yes
Divisible by 11No, remainder 3
Divisible by 12No, remainder 2
Divisible by 100No, remainder 50
As a percentage & fraction
As a percentage-305,000%
-3,050% as a decimal-30.5
-3,050% of 100-3,050
-3,050% of 1,000-30,500
As a fraction of 100-3,050/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,050
Nerdulate something else
Nothing in mind? Surprise me · today’s page