Recognised as Number
-370,642
- Negative
- Even
- 6 digits
-370,642 is an even 6-digit integer and the negative of 370,642. It has 8 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value370,642
Digit count6
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 47 × 3,943
Distinct prime factors32, 47, 3,943
Number of divisors8
Sum of divisors σ(n)567,936
SquarefreeYesno repeated prime factor
All divisors1, 2, 47, 94, 3,943, 7,886, 185,321, 370,6428 in total
Arithmetic
Representations
Decimal-370,642
Binary101101001111101001019 bits
Octal1323722
Hexadecimal5A7D2
Base 367XZM
In wordsminus three hundred and seventy thousand, six hundred and forty-two
Ordinalminus three hundred and seventy thousand, six hundred and forty-second
Scientific notation-3.70642 × 10^5
Engineering notation-370.642 × 10^3
In other bases
Ternary200211102111base 3; the most digit-efficient integer base after e: 12 digits
Quinary43330032base 5; one hand: 8 digits
Septenary3102406base 7: 7 digits
Nonary624374base 9; each digit is two ternary digits: 6 digits
Duodecimal15a5aabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal266c2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:42:57:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T1TTTT1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010100001110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110100101100000101110
Bit length19 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits8within that length
Bit parityodd11 set bits, so odd; 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 a7 d2
Gray code1110111010000111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110100101100000101110two's complement
64-bit1111111111111111111111111111111111111111111110100101100000101110two's complement
One's complement00000000000001011010011111010001at 32 bits, every bit flipped
Bits reversed01110100000110100101111111111111at 32 bits
Rotated left by 111111111111101001011000001011101at 32 bits, wrapping
Shifted left by 1-10110100111110100100= -741,284, no wrap
Shifted right by 1-101101001111101001= -185,321, discarding the low bit
These bits as a double1.83121479 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-370,642 to the power 2137,375,492,164
-370,642 to the power 3-50,917,127,166,649,288
-370,642 to the power 418,872,025,847,301,225,402,896
-370,642 to the power 5-6,994,765,404,095,420,785,780,179,232
First ten multiples-370,642, -741,284, -1,111,926, -1,482,568, -1,853,210, -2,223,852, -2,594,494, -2,965,136, -3,335,778, -3,706,420
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 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 10
Divisible by 100No, remainder 42
As a percentage & fraction
As a percentage-37,064,200%
-370,642% as a decimal-3,706.42
-370,642% of 100-370,642
-370,642% of 1,000-3,706,420
As a fraction of 100-370,642/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -370,642
Nerdulate something else
Nothing in mind? Surprise me · today’s page