Recognised as Number
-6,051
- Negative
- Odd
- 4 digits
-6,051 is an odd 4-digit integer and the negative of 6,051. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value6,051
Digit count4
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 2,017
Distinct prime factors23, 2,017
Number of divisors4
Sum of divisors σ(n)8,072
SquarefreeYesno repeated prime factor
All divisors1, 3, 2,017, 6,0514 in total
Arithmetic
Previous number-6,052
Next number-6,050
Double-12,102
Half-3,025.5
Square36,614,601
Cube-221,554,950,651
Cube root-18.222545822≈
Negation6,051
Reciprocal-0.0001652619≈
Representations
Decimal-6,051
Binary101111010001113 bits
Octal13643
Hexadecimal17A3
Base 364O3
In wordsminus six thousand and fifty-one
Ordinalminus six thousand and fifty-first
Scientific notation-6.051 × 10^3
Engineering notation-6.051 × 10^3
In other bases
Ternary22022010base 3; the most digit-efficient integer base after e: 8 digits
Quinary143201base 5; one hand: 6 digits
Septenary23433base 7: 5 digits
Nonary8263base 9; each digit is two ternary digits: 4 digits
Duodecimal3603base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalf2bbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:40:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01T010T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110100001011101
Bit length13 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits5within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes217 a3
Gray code1110001110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110100001011101two's complement
32-bit11111111111111111110100001011101two's complement
64-bit1111111111111111111111111111111111111111111111111110100001011101two's complement
One's complement0001011110100010at 16 bits, every bit flipped
Bits reversed1011101000010111at 16 bits
Rotated left by 11101000010111011at 16 bits, wrapping
Shifted left by 1-10111101000110= -12,102, no wrap
Shifted right by 1-101111010010= -3,025, discarding the low bit
These bits as a double2.98959122 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-6,051 to the power 236,614,601
-6,051 to the power 3-221,554,950,651
-6,051 to the power 41,340,629,006,389,201
-6,051 to the power 5-8,112,146,117,661,055,251
First ten multiples-6,051, -12,102, -18,153, -24,204, -30,255, -36,306, -42,357, -48,408, -54,459, -60,510
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-605,100%
-6,051% as a decimal-60.51
-6,051% of 100-6,051
-6,051% of 1,000-60,510
As a fraction of 100-6,051/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -6,051
Nerdulate something else
Nothing in mind? Surprise me · today’s page