Recognised as Number
-515
- Negative
- Odd
- 3 digits
-515 is an odd 3-digit integer and the negative of 515. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value515
Digit count3
Digit sum11
Digit product25
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicYesreads the same backwards
Factors & divisors
Prime factorisation−1 × 5 × 103
Distinct prime factors25, 103
Number of divisors4
Sum of divisors σ(n)624
SquarefreeYesno repeated prime factor
All divisors1, 5, 103, 5154 in total
Arithmetic
Representations
Decimal-515
Binary100000001110 bits
Octal1003
Hexadecimal203
Base 36EB
In wordsminus five hundred and fifteen
Ordinalminus five hundred and fifteenth
Scientific notation-5.15 × 10^2
Engineering notation-515
In other bases
Ternary201002base 3; the most digit-efficient integer base after e: 6 digits
Quinary4030base 5; one hand: 4 digits
Septenary1334base 7: 4 digits
Nonary632base 9; each digit is two ternary digits: 3 digits
Duodecimal36bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal15fbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal8:35base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT10T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111110111111101
Bit length10 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits7within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 9worth 512
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes202 03
Gray code1100000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111110111111101two's complement
32-bit11111111111111111111110111111101two's complement
64-bit1111111111111111111111111111111111111111111111111111110111111101two's complement
One's complement0000001000000010at 16 bits, every bit flipped
Bits reversed1011111110111111at 16 bits
Rotated left by 11111101111111011at 16 bits, wrapping
Shifted left by 1-10000000110= -1,030, no wrap
Shifted right by 1-100000010= -257, discarding the low bit
These bits as a double2.54443808 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-515 to the power 2265,225
-515 to the power 3-136,590,875
-515 to the power 470,344,300,625
-515 to the power 5-36,227,314,821,875
First ten multiples-515, -1,030, -1,545, -2,060, -2,575, -3,090, -3,605, -4,120, -4,635, -5,150
Powers of twoBetween 2^9 (512) and 2^10 (1,024)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 15
As a percentage & fraction
As a percentage-51,500%
-515% as a decimal-5.15
-515% of 100-515
-515% of 1,000-5,150
As a fraction of 100-515/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -515
Nerdulate something else
Nothing in mind? Surprise me · today’s page