Recognised as Number
-370,978
- Negative
- Even
- 6 digits
-370,978 is an even 6-digit integer and the negative of 370,978. It has 8 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value370,978
Digit count6
Digit sum34
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 251 × 739
Distinct prime factors32, 251, 739
Number of divisors8
Sum of divisors σ(n)559,440
SquarefreeYesno repeated prime factor
All divisors1, 2, 251, 502, 739, 1,478, 185,489, 370,9788 in total
Arithmetic
Representations
Decimal-370,978
Binary101101010010010001019 bits
Octal1324442
Hexadecimal5A922
Base 367Y8Y
In wordsminus three hundred and seventy thousand, nine hundred and seventy-eight
Ordinalminus three hundred and seventy thousand, nine hundred and seventy-eighth
Scientific notation-3.70978 × 10^5
Engineering notation-370.978 × 10^3
In other bases
Ternary200211212221base 3; the most digit-efficient integer base after e: 12 digits
Quinary43332403base 5; one hand: 8 digits
Septenary3103366base 7: 7 digits
Nonary624787base 9; each digit is two ternary digits: 6 digits
Duodecimal15a82abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal2678ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:43:2:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T01101001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010101100100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110100101011011011110
Bit length19 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits11within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes305 a9 22
Gray code1110111110110110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110100101011011011110two's complement
64-bit1111111111111111111111111111111111111111111110100101011011011110two's complement
One's complement00000000000001011010100100100001at 32 bits, every bit flipped
Bits reversed01111011011010100101111111111111at 32 bits
Rotated left by 111111111111101001010110110111101at 32 bits, wrapping
Shifted left by 1-10110101001001000100= -741,956, no wrap
Shifted right by 1-101101010010010001= -185,489, discarding the low bit
These bits as a double1.83287485 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-370,978 to the power 2137,624,676,484
-370,978 to the power 3-51,055,727,232,681,352
-370,978 to the power 418,940,551,577,325,662,602,256
-370,978 to the power 5-7,026,527,943,053,119,660,859,726,368
First ten multiples-370,978, -741,956, -1,112,934, -1,483,912, -1,854,890, -2,225,868, -2,596,846, -2,967,824, -3,338,802, -3,709,780
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 78
As a percentage & fraction
As a percentage-37,097,800%
-370,978% as a decimal-3,709.78
-370,978% of 100-370,978
-370,978% of 1,000-3,709,780
As a fraction of 100-370,978/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -370,978
Nerdulate something else
Nothing in mind? Surprise me · today’s page