Recognised as Number
-3,152
- Negative
- Even
- 4 digits
-3,152 is an even 4-digit integer and the negative of 3,152. It has 10 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value3,152
Digit count4
Digit sum11
Digit product30
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^4 × 197
Distinct prime factors22, 197
Number of divisors10
Sum of divisors σ(n)6,138
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 197, 394, 788, 1,576, 3,15210 in total
Arithmetic
Representations
Decimal-3,152
Binary11000101000012 bits
Octal6120
HexadecimalC50
Base 362FK
In wordsminus three thousand, one hundred and fifty-two
Ordinalminus three thousand, one hundred and fifty-second
Scientific notation-3.152 × 10^3
Engineering notation-3.152 × 10^3
In other bases
Ternary11022202base 3; the most digit-efficient integer base after e: 8 digits
Quinary100102base 5; one hand: 6 digits
Septenary12122base 7: 5 digits
Nonary4282base 9; each digit is two ternary digits: 4 digits
Duodecimal19a8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal7hcbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal52:32base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTTT001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001110110000
Bit length12 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits8within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 11worth 2,048
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes20c 50
Gray code101001111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001110110000two's complement
32-bit11111111111111111111001110110000two's complement
64-bit1111111111111111111111111111111111111111111111111111001110110000two's complement
One's complement0000110001001111at 16 bits, every bit flipped
Bits reversed0000110111001111at 16 bits
Rotated left by 11110011101100001at 16 bits, wrapping
Shifted left by 1-1100010100000= -6,304, no wrap
Shifted right by 1-11000101000= -1,576, discarding the low bit
These bits as a double1.55729492 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,152 to the power 29,935,104
-3,152 to the power 3-31,315,447,808
-3,152 to the power 498,706,291,490,816
-3,152 to the power 5-311,122,230,779,052,032
First ten multiples-3,152, -6,304, -9,456, -12,608, -15,760, -18,912, -22,064, -25,216, -28,368, -31,520
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 8
Divisible by 100No, remainder 52
As a percentage & fraction
As a percentage-315,200%
-3,152% as a decimal-31.52
-3,152% of 100-3,152
-3,152% of 1,000-31,520
As a fraction of 100-3,152/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,152
Nerdulate something else
Nothing in mind? Surprise me · today’s page