Recognised as Number
-3,750
- Negative
- Even
- 4 digits
-3,750 is an even 4-digit integer and the negative of 3,750. It has 20 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value3,750
Digit count4
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3 × 5^4
Distinct prime factors32, 3, 5
Number of divisors20
Sum of divisors σ(n)9,372
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 125, 150, 250, 375, 625, 750, 1,250, 1,875, 3,75020 in total
Arithmetic
Previous number-3,751
Next number-3,749
Double-7,500
Half-1,875
Square14,062,500
Cube-52,734,375,000
Cube root-15.53616253≈
Negation3,750
Reciprocal-0.0002666667≈
Representations
Decimal-3,750
Binary11101010011012 bits
Octal7246
HexadecimalEA6
Base 362W6
In wordsminus three thousand, seven hundred and fifty
Ordinalminus three thousand, seven hundred and fiftieth
Scientific notation-3.75 × 10^3
Engineering notation-3.75 × 10^3
In other bases
Ternary12010220base 3; the most digit-efficient integer base after e: 8 digits
Quinary110000base 5; one hand: 6 digits
Septenary13635base 7: 5 digits
Nonary5126base 9; each digit is two ternary digits: 4 digits
Duodecimal2206base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal97abase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:2:30base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110TT010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011010101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111000101011010
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 even
Highest set bitbit 11worth 2,048
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes20e a6
Gray code100111110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111000101011010two's complement
32-bit11111111111111111111000101011010two's complement
64-bit1111111111111111111111111111111111111111111111111111000101011010two's complement
One's complement0000111010100101at 16 bits, every bit flipped
Bits reversed0101101010001111at 16 bits
Rotated left by 11110001010110101at 16 bits, wrapping
Shifted left by 1-1110101001100= -7,500, no wrap
Shifted right by 1-11101010011= -1,875, discarding the low bit
These bits as a double1.85274617 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,750 to the power 214,062,500
-3,750 to the power 3-52,734,375,000
-3,750 to the power 4197,753,906,250,000
-3,750 to the power 5-741,577,148,437,500,000
First ten multiples-3,750, -7,500, -11,250, -15,000, -18,750, -22,500, -26,250, -30,000, -33,750, -37,500
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 6
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 50
As a percentage & fraction
As a percentage-375,000%
-3,750% as a decimal-37.5
-3,750% of 100-3,750
-3,750% of 1,000-37,500
As a fraction of 100-3,750/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,750
Nerdulate something else
Nothing in mind? Surprise me · today’s page