Recognised as Number
-6,013
- Negative
- Odd
- 4 digits
-6,013 is an odd 4-digit integer and the negative of 6,013. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value6,013
Digit count4
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 859
Distinct prime factors27, 859
Number of divisors4
Sum of divisors σ(n)6,880
SquarefreeYesno repeated prime factor
All divisors1, 7, 859, 6,0134 in total
Arithmetic
Previous number-6,014
Next number-6,012
Double-12,026
Half-3,006.5
Square36,156,169
Cube-217,407,044,197
Cube root-18.18432011≈
Negation6,013
Reciprocal-0.0001663063≈
Representations
Decimal-6,013
Binary101110111110113 bits
Octal13575
Hexadecimal177D
Base 364N1
In wordsminus six thousand and thirteen
Ordinalminus six thousand and thirteenth
Scientific notation-6.013 × 10^3
Engineering notation-6.013 × 10^3
In other bases
Ternary22020201base 3; the most digit-efficient integer base after e: 8 digits
Quinary143023base 5; one hand: 6 digits
Septenary23350base 7: 5 digits
Nonary8221base 9; each digit is two ternary digits: 4 digits
Duodecimal3591base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalf0dbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:40:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01T1T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110100010000011
Bit length13 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits3within that length
Bit parityeven10 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 7d
Gray code1110011000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110100010000011two's complement
32-bit11111111111111111110100010000011two's complement
64-bit1111111111111111111111111111111111111111111111111110100010000011two's complement
One's complement0001011101111100at 16 bits, every bit flipped
Bits reversed1100000100010111at 16 bits
Rotated left by 11101000100000111at 16 bits, wrapping
Shifted left by 1-10111011111010= -12,026, no wrap
Shifted right by 1-101110111111= -3,006, discarding the low bit
These bits as a double2.97081673 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-6,013 to the power 236,156,169
-6,013 to the power 3-217,407,044,197
-6,013 to the power 41,307,268,556,756,561
-6,013 to the power 5-7,860,605,831,777,201,293
First ten multiples-6,013, -12,026, -18,039, -24,052, -30,065, -36,078, -42,091, -48,104, -54,117, -60,130
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-601,300%
-6,013% as a decimal-60.13
-6,013% of 100-6,013
-6,013% of 1,000-60,130
As a fraction of 100-6,013/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -6,013
Nerdulate something else
Nothing in mind? Surprise me · today’s page