Recognised as Number
-2,470
- Negative
- Even
- 4 digits
-2,470 is an even 4-digit integer and the negative of 2,470. It has 16 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value2,470
Digit count4
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5 × 13 × 19
Distinct prime factors42, 5, 13, 19
Number of divisors16
Sum of divisors σ(n)5,040
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 13, 19, 26, 38, 65, 95, 130, 190, 247, 494, 1,235, 2,47016 in total
Arithmetic
Representations
Decimal-2,470
Binary10011010011012 bits
Octal4646
Hexadecimal9A6
Base 361WM
In wordsminus two thousand, four hundred and seventy
Ordinalminus two thousand, four hundred and seventieth
Scientific notation-2.47 × 10^3
Engineering notation-2.47 × 10^3
In other bases
Ternary10101111base 3; the most digit-efficient integer base after e: 8 digits
Quinary34340base 5; one hand: 5 digits
Septenary10126base 7: 5 digits
Nonary3344base 9; each digit is two ternary digits: 4 digits
Duodecimal151abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal63abase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal41:10base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT0T0TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111011001011010
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
Bytes209 a6
Gray code110101110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111011001011010two's complement
32-bit11111111111111111111011001011010two's complement
64-bit1111111111111111111111111111111111111111111111111111011001011010two's complement
One's complement0000100110100101at 16 bits, every bit flipped
Bits reversed0101101001101111at 16 bits
Rotated left by 11110110010110101at 16 bits, wrapping
Shifted left by 1-1001101001100= -4,940, no wrap
Shifted right by 1-10011010011= -1,235, discarding the low bit
These bits as a double1.22034215 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,470 to the power 26,100,900
-2,470 to the power 3-15,069,223,000
-2,470 to the power 437,220,980,810,000
-2,470 to the power 5-91,935,822,600,700,000
First ten multiples-2,470, -4,940, -7,410, -9,880, -12,350, -14,820, -17,290, -19,760, -22,230, -24,700
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 6
Divisible by 12No, remainder 10
Divisible by 100No, remainder 70
As a percentage & fraction
As a percentage-247,000%
-2,470% as a decimal-24.7
-2,470% of 100-2,470
-2,470% of 1,000-24,700
As a fraction of 100-2,470/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,470
Nerdulate something else
Nothing in mind? Surprise me · today’s page