Recognised as Number
-2,500
- Negative
- Even
- Perfect square
- 4 digits
-2,500 is an even 4-digit integer and the negative of 2,500. It has 15 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value2,500
Digit count4
Digit sum7
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 50²
Factors & divisors
Prime factorisation−1 × 2^2 × 5^4
Distinct prime factors22, 5
Number of divisors15
Sum of divisors σ(n)5,467
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 25, 50, 100, 125, 250, 500, 625, 1,250, 2,50015 in total
Arithmetic
Representations
Decimal-2,500
Binary10011100010012 bits
Octal4704
Hexadecimal9C4
Base 361XG
In wordsminus two thousand, five hundred
Ordinalminus two thousand, five hundredth
Scientific notation-2.5 × 10^3
Engineering notation-2.5 × 10^3
In other bases
Ternary10102121base 3; the most digit-efficient integer base after e: 8 digits
Quinary40000base 5; one hand: 5 digits
Septenary10201base 7: 5 digits
Nonary3377base 9; each digit is two ternary digits: 4 digits
Duodecimal1544base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal650base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal41:40base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT0TT011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111011000111100
Bit length12 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits7within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 11worth 2,048
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes209 c4
Gray code110100100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111011000111100two's complement
32-bit11111111111111111111011000111100two's complement
64-bit1111111111111111111111111111111111111111111111111111011000111100two's complement
One's complement0000100111000011at 16 bits, every bit flipped
Bits reversed0011110001101111at 16 bits
Rotated left by 11110110001111001at 16 bits, wrapping
Shifted left by 1-1001110001000= -5,000, no wrap
Shifted right by 1-10011100010= -1,250, discarding the low bit
These bits as a double1.23516411 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,500 to the power 26,250,000
-2,500 to the power 3-15,625,000,000
-2,500 to the power 439,062,500,000,000
-2,500 to the power 5-97,656,250,000,000,000
First ten multiples-2,500, -5,000, -7,500, -10,000, -12,500, -15,000, -17,500, -20,000, -22,500, -25,000
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100Yes
As a percentage & fraction
As a percentage-250,000%
-2,500% as a decimal-25
-2,500% of 100-2,500
-2,500% of 1,000-25,000
As a fraction of 100-2,500/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,500
Nerdulate something else
Nothing in mind? Surprise me · today’s page