Recognised as Number
-605
- Negative
- Odd
- 3 digits
-605 is an odd 3-digit integer and the negative of 605. It has 6 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value605
Digit count3
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 11^2
Distinct prime factors25, 11
Number of divisors6
Sum of divisors σ(n)798
SquarefreeNohas a repeated prime factor
All divisors1, 5, 11, 55, 121, 6056 in total
Arithmetic
Representations
Decimal-605
Binary100101110110 bits
Octal1135
Hexadecimal25D
Base 36GT
In wordsminus six hundred and five
Ordinalminus six hundred and fifth
Scientific notation-6.05 × 10^2
Engineering notation-605
In other bases
Ternary211102base 3; the most digit-efficient integer base after e: 6 digits
Quinary4410base 5; one hand: 4 digits
Septenary1523base 7: 4 digits
Nonary742base 9; each digit is two ternary digits: 3 digits
Duodecimal425base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal1a5base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal10:5base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT1TTTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1011100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111110110100011
Bit length10 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits4within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 9worth 512
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes202 5d
Gray code1101110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111110110100011two's complement
32-bit11111111111111111111110110100011two's complement
64-bit1111111111111111111111111111111111111111111111111111110110100011two's complement
One's complement0000001001011100at 16 bits, every bit flipped
Bits reversed1100010110111111at 16 bits
Rotated left by 11111101101000111at 16 bits, wrapping
Shifted left by 1-10010111010= -1,210, no wrap
Shifted right by 1-100101111= -302, discarding the low bit
These bits as a double2.98909716 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-605 to the power 2366,025
-605 to the power 3-221,445,125
-605 to the power 4133,974,300,625
-605 to the power 5-81,054,451,878,125
First ten multiples-605, -1,210, -1,815, -2,420, -3,025, -3,630, -4,235, -4,840, -5,445, -6,050
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 1
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 5
As a percentage & fraction
As a percentage-60,500%
-605% as a decimal-6.05
-605% of 100-605
-605% of 1,000-6,050
As a fraction of 100-605/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -605
Nerdulate something else
Nothing in mind? Surprise me · today’s page