Recognised as Number
-67,770
- Negative
- Even
- 5 digits
-67,770 is an even 5-digit integer and the negative of 67,770. It has 32 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value67,770
Digit count5
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3^3 × 5 × 251
Distinct prime factors42, 3, 5, 251
Number of divisors32
Sum of divisors σ(n)181,440
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 251, 270, 502, 753, 1,255, 1,506, 2,259, 2,510, 3,765, 4,518, 6,777, 7,530, 11,295, 13,554, 22,590, 33,885, 67,77032 in total
Arithmetic
Representations
Decimal-67,770
Binary1000010001011101017 bits
Octal204272
Hexadecimal108BA
Base 361GAI
In wordsminus sixty-seven thousand, seven hundred and seventy
Ordinalminus sixty-seven thousand, seven hundred and seventieth
Scientific notation-6.777 × 10^4
Engineering notation-67.77 × 10^3
In other bases
Ternary10102222000base 3; the most digit-efficient integer base after e: 11 digits
Quinary4132040base 5; one hand: 7 digits
Septenary401403base 7: 6 digits
Nonary112860base 9; each digit is two ternary digits: 6 digits
Duodecimal33276base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal898abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:49:30base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0TT0001000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110000101101011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111101111011101000110
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 08 ba
Gray code11000110011100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111101111011101000110two's complement
64-bit1111111111111111111111111111111111111111111111101111011101000110two's complement
One's complement00000000000000010000100010111001at 32 bits, every bit flipped
Bits reversed01100010111011110111111111111111at 32 bits
Rotated left by 111111111111111011110111010001101at 32 bits, wrapping
Shifted left by 1-100001000101110100= -135,540, no wrap
Shifted right by 1-1000010001011101= -33,885, discarding the low bit
These bits as a double3.34828288 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-67,770 to the power 24,592,772,900
-67,770 to the power 3-311,252,219,433,000
-67,770 to the power 421,093,562,910,974,410,000
-67,770 to the power 5-1,429,510,758,476,735,765,700,000
First ten multiples-67,770, -135,540, -203,310, -271,080, -338,850, -406,620, -474,390, -542,160, -609,930, -677,700
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 70
As a percentage & fraction
As a percentage-6,777,000%
-67,770% as a decimal-677.7
-67,770% of 100-67,770
-67,770% of 1,000-677,700
As a fraction of 100-67,770/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -67,770
Nerdulate something else
Nothing in mind? Surprise me · today’s page