Recognised as Number
-505
- Negative
- Odd
- 3 digits
-505 is an odd 3-digit integer and the negative of 505. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value505
Digit count3
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
PalindromicYesreads the same backwards
Factors & divisors
Prime factorisation−1 × 5 × 101
Distinct prime factors25, 101
Number of divisors4
Sum of divisors σ(n)612
SquarefreeYesno repeated prime factor
All divisors1, 5, 101, 5054 in total
Arithmetic
Representations
Decimal-505
Binary1111110019 bits
Octal771
Hexadecimal1F9
Base 36E1
In wordsminus five hundred and five
Ordinalminus five hundred and fifth
Scientific notation-5.05 × 10^2
Engineering notation-505
In other bases
Ternary200201base 3; the most digit-efficient integer base after e — 6 digits
Quinary4010base 5; one hand — 4 digits
Septenary1321base 7 — 4 digits
Nonary621base 9; each digit is two ternary digits — 3 digits
Duodecimal361base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves — 3 digits
Vigesimal155base 20; hands and feet, and the Mayan and Yoruba systems — 3 digits
Sexagesimal8:25base 60; Babylonian, and still how an hour and a circle are divided — 2 digits
Balanced ternaryT10T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111000000111
Bit length9 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits2within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 8worth 256
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes201 f9
Gray code100000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111111000000111two's complement
32-bit11111111111111111111111000000111two's complement
64-bit1111111111111111111111111111111111111111111111111111111000000111two's complement
One's complement0000000111111000at 16 bits, every bit flipped
Bits reversed1110000001111111at 16 bits
Rotated left by 11111110000001111at 16 bits, wrapping
Shifted left by 1-1111110010= -1,010, no wrap
Shifted right by 1-11111101= -252, discarding the low bit
These bits as a double2.49503151 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-505 to the power 2255,025
-505 to the power 3-128,787,625
-505 to the power 465,037,750,625
-505 to the power 5-32,844,064,065,625
First ten multiples-505, -1,010, -1,515, -2,020, -2,525, -3,030, -3,535, -4,040, -4,545, -5,050
Powers of twoBetween 2^8 (256) and 2^9 (512)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 5
As a percentage & fraction
As a percentage-50,500%
-505% as a decimal-5.05
-505% of 100-505
-505% of 1,000-5,050
As a fraction of 100-505/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -505
Nerdulate something else
Nothing in mind? Surprise me · today’s page