Recognised as Number
-1,506
- Negative
- Even
- 4 digits
-1,506 is an even 4-digit integer and the negative of 1,506. It has 8 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value1,506
Digit count4
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3 × 251
Distinct prime factors32, 3, 251
Number of divisors8
Sum of divisors σ(n)3,024
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 251, 502, 753, 1,5068 in total
Arithmetic
Representations
Decimal-1,506
Binary1011110001011 bits
Octal2742
Hexadecimal5E2
Base 3615U
In wordsminus one thousand, five hundred and six
Ordinalminus one thousand, five hundred and sixth
Scientific notation-1.506 × 10^3
Engineering notation-1.506 × 10^3
In other bases
Ternary2001210base 3; the most digit-efficient integer base after e: 7 digits
Quinary22011base 5; one hand: 5 digits
Septenary4251base 7: 4 digits
Nonary2053base 9; each digit is two ternary digits: 4 digits
Duodecimala56base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal3f6base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal25:6base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT10T11T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111001100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111101000011110
Bit length11 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits5within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 10worth 1,024
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes205 e2
Gray code11100010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111101000011110two's complement
32-bit11111111111111111111101000011110two's complement
64-bit1111111111111111111111111111111111111111111111111111101000011110two's complement
One's complement0000010111100001at 16 bits, every bit flipped
Bits reversed0111100001011111at 16 bits
Rotated left by 11111010000111101at 16 bits, wrapping
Shifted left by 1-101111000100= -3,012, no wrap
Shifted right by 1-1011110001= -753, discarding the low bit
These bits as a double7.44062863 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-1,506 to the power 22,268,036
-1,506 to the power 3-3,415,662,216
-1,506 to the power 45,143,987,297,296
-1,506 to the power 5-7,746,844,869,727,776
First ten multiples-1,506, -3,012, -4,518, -6,024, -7,530, -9,036, -10,542, -12,048, -13,554, -15,060
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 3
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 6
As a percentage & fraction
As a percentage-150,600%
-1,506% as a decimal-15.06
-1,506% of 100-1,506
-1,506% of 1,000-15,060
As a fraction of 100-1,506/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -1,506
Nerdulate something else
Nothing in mind? Surprise me · today’s page