Recognised as Number
-1,540
- Negative
- Even
- 4 digits
-1,540 is an even 4-digit integer and the negative of 1,540. It has 24 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value1,540
Digit count4
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 5 × 7 × 11
Distinct prime factors42, 5, 7, 11
Number of divisors24
Sum of divisors σ(n)4,032
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 7, 10, 11, 14, 20, 22, 28, 35, 44, 55, 70, 77, 110, 140, 154, 220, 308, 385, 770, 1,54024 in total
Arithmetic
Representations
Decimal-1,540
Binary1100000010011 bits
Octal3004
Hexadecimal604
Base 3616S
In wordsminus one thousand, five hundred and forty
Ordinalminus one thousand, five hundred and fortieth
Scientific notation-1.54 × 10^3
Engineering notation-1.54 × 10^3
In other bases
Ternary2010001base 3; the most digit-efficient integer base after e: 7 digits
Quinary22130base 5; one hand: 5 digits
Septenary4330base 7: 4 digits
Nonary2101base 9; each digit is two ternary digits: 4 digits
Duodecimala84base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal3h0base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal25:40base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT10T000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111100111111100
Bit length11 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits8within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being even
Highest set bitbit 10worth 1,024
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes206 04
Gray code10100000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111100111111100two's complement
32-bit11111111111111111111100111111100two's complement
64-bit1111111111111111111111111111111111111111111111111111100111111100two's complement
One's complement0000011000000011at 16 bits, every bit flipped
Bits reversed0011111110011111at 16 bits
Rotated left by 11111001111111001at 16 bits, wrapping
Shifted left by 1-110000001000= -3,080, no wrap
Shifted right by 1-1100000010= -770, discarding the low bit
These bits as a double7.60861095 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-1,540 to the power 22,371,600
-1,540 to the power 3-3,652,264,000
-1,540 to the power 45,624,486,560,000
-1,540 to the power 5-8,661,709,302,400,000
First ten multiples-1,540, -3,080, -4,620, -6,160, -7,700, -9,240, -10,780, -12,320, -13,860, -15,400
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11Yes
Divisible by 12No, remainder 4
Divisible by 100No, remainder 40
As a percentage & fraction
As a percentage-154,000%
-1,540% as a decimal-15.4
-1,540% of 100-1,540
-1,540% of 1,000-15,400
As a fraction of 100-1,540/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -1,540
Nerdulate something else
Nothing in mind? Surprise me · today’s page