Recognised as Number
-3,151
- Negative
- Odd
- 4 digits
-3,151 is an odd 4-digit integer and the negative of 3,151. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,151
Digit count4
Digit sum10
Digit product15
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 23 × 137
Distinct prime factors223, 137
Number of divisors4
Sum of divisors σ(n)3,312
SquarefreeYesno repeated prime factor
All divisors1, 23, 137, 3,1514 in total
Arithmetic
Representations
Decimal-3,151
Binary11000100111112 bits
Octal6117
HexadecimalC4F
Base 362FJ
In wordsminus three thousand, one hundred and fifty-one
Ordinalminus three thousand, one hundred and fifty-first
Scientific notation-3.151 × 10^3
Engineering notation-3.151 × 10^3
In other bases
Ternary11022201base 3; the most digit-efficient integer base after e: 8 digits
Quinary100101base 5; one hand: 6 digits
Septenary12121base 7: 5 digits
Nonary4281base 9; each digit is two ternary digits: 4 digits
Duodecimal19a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal7hbbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal52:31base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTTT0010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001110110001
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 odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes20c 4f
Gray code101001101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001110110001two's complement
32-bit11111111111111111111001110110001two's complement
64-bit1111111111111111111111111111111111111111111111111111001110110001two's complement
One's complement0000110001001110at 16 bits, every bit flipped
Bits reversed1000110111001111at 16 bits
Rotated left by 11110011101100011at 16 bits, wrapping
Shifted left by 1-1100010011110= -6,302, no wrap
Shifted right by 1-11000101000= -1,575, discarding the low bit
These bits as a double1.55680085 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,151 to the power 29,928,801
-3,151 to the power 3-31,285,651,951
-3,151 to the power 498,581,089,297,601
-3,151 to the power 5-310,629,012,376,740,751
First ten multiples-3,151, -6,302, -9,453, -12,604, -15,755, -18,906, -22,057, -25,208, -28,359, -31,510
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-315,100%
-3,151% as a decimal-31.51
-3,151% of 100-3,151
-3,151% of 1,000-31,510
As a fraction of 100-3,151/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,151
Nerdulate something else
Nothing in mind? Surprise me · today’s page