Recognised as Number
-2,898
- Negative
- Even
- 4 digits
-2,898 is an even 4-digit integer and the negative of 2,898. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value2,898
Digit count4
Digit sum27
Digit product1,152
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3^2 × 7 × 23
Distinct prime factors42, 3, 7, 23
Number of divisors24
Sum of divisors σ(n)7,488
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 7, 9, 14, 18, 21, 23, 42, 46, 63, 69, 126, 138, 161, 207, 322, 414, 483, 966, 1,449, 2,89824 in total
Arithmetic
Representations
Decimal-2,898
Binary10110101001012 bits
Octal5522
HexadecimalB52
Base 3628I
In wordsminus two thousand, eight hundred and ninety-eight
Ordinalminus two thousand, eight hundred and ninety-eighth
Scientific notation-2.898 × 10^3
Engineering notation-2.898 × 10^3
In other bases
Ternary10222100base 3; the most digit-efficient integer base after e: 8 digits
Quinary43043base 5; one hand: 5 digits
Septenary11310base 7: 5 digits
Nonary3870base 9; each digit is two ternary digits: 4 digits
Duodecimal1816base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal74ibase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal48:18base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTT001T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111010010101110
Bit length12 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits6within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 11worth 2,048
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes20b 52
Gray code111011111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111010010101110two's complement
32-bit11111111111111111111010010101110two's complement
64-bit1111111111111111111111111111111111111111111111111111010010101110two's complement
One's complement0000101101010001at 16 bits, every bit flipped
Bits reversed0111010100101111at 16 bits
Rotated left by 11110100101011101at 16 bits, wrapping
Shifted left by 1-1011010100100= -5,796, no wrap
Shifted right by 1-10110101001= -1,449, discarding the low bit
These bits as a double1.43180224 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,898 to the power 28,398,404
-2,898 to the power 3-24,338,574,792
-2,898 to the power 470,533,189,747,216
-2,898 to the power 5-204,405,183,887,431,968
First ten multiples-2,898, -5,796, -8,694, -11,592, -14,490, -17,388, -20,286, -23,184, -26,082, -28,980
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 5No, remainder 3
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 8
Divisible by 11No, remainder 5
Divisible by 12No, remainder 6
Divisible by 100No, remainder 98
As a percentage & fraction
As a percentage-289,800%
-2,898% as a decimal-28.98
-2,898% of 100-2,898
-2,898% of 1,000-28,980
As a fraction of 100-2,898/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,898
Nerdulate something else
Nothing in mind? Surprise me · today’s page