Recognised as Number
-2,325
- Negative
- Odd
- 4 digits
-2,325 is an odd 4-digit integer and the negative of 2,325. It has 12 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value2,325
Digit count4
Digit sum12
Digit product60
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5^2 × 31
Distinct prime factors33, 5, 31
Number of divisors12
Sum of divisors σ(n)3,968
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 15, 25, 31, 75, 93, 155, 465, 775, 2,32512 in total
Arithmetic
Representations
Decimal-2,325
Binary10010001010112 bits
Octal4425
Hexadecimal915
Base 361SL
In wordsminus two thousand, three hundred and twenty-five
Ordinalminus two thousand, three hundred and twenty-fifth
Scientific notation-2.325 × 10^3
Engineering notation-2.325 × 10^3
In other bases
Ternary10012010base 3; the most digit-efficient integer base after e: 8 digits
Quinary33300base 5; one hand: 5 digits
Septenary6531base 7: 4 digits
Nonary3163base 9; each digit is two ternary digits: 4 digits
Duodecimal1419base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal5g5base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal38:45base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT0T110T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111011011101011
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 odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes209 15
Gray code110110011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111011011101011two's complement
32-bit11111111111111111111011011101011two's complement
64-bit1111111111111111111111111111111111111111111111111111011011101011two's complement
One's complement0000100100010100at 16 bits, every bit flipped
Bits reversed1101011101101111at 16 bits
Rotated left by 11110110111010111at 16 bits, wrapping
Shifted left by 1-1001000101010= -4,650, no wrap
Shifted right by 1-10010001011= -1,162, discarding the low bit
These bits as a double1.14870263 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,325 to the power 25,405,625
-2,325 to the power 3-12,568,078,125
-2,325 to the power 429,220,781,640,625
-2,325 to the power 5-67,938,317,314,453,125
First ten multiples-2,325, -4,650, -6,975, -9,300, -11,625, -13,950, -16,275, -18,600, -20,925, -23,250
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 25
As a percentage & fraction
As a percentage-232,500%
-2,325% as a decimal-23.25
-2,325% of 100-2,325
-2,325% of 1,000-23,250
As a fraction of 100-2,325/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,325
Nerdulate something else
Nothing in mind? Surprise me · today’s page