Recognised as Number
-349,082
- Negative
- Even
- 6 digits
-349,082 is an even 6-digit integer and the negative of 349,082. It has 8 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value349,082
Digit count6
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 347 × 503
Distinct prime factors32, 347, 503
Number of divisors8
Sum of divisors σ(n)526,176
SquarefreeYesno repeated prime factor
All divisors1, 2, 347, 503, 694, 1,006, 174,541, 349,0828 in total
Arithmetic
Representations
Decimal-349,082
Binary101010100111001101019 bits
Octal1251632
Hexadecimal5539A
Base 367HCQ
In wordsminus three hundred and forty-nine thousand and eighty-two
Ordinalminus three hundred and forty-nine thousand and eighty-second
Scientific notation-3.49082 × 10^5
Engineering notation-349.082 × 10^3
In other bases
Ternary122201211222base 3; the most digit-efficient integer base after e: 12 digits
Quinary42132312base 5; one hand: 8 digits
Septenary2652506base 7: 7 digits
Nonary581758base 9; each digit is two ternary digits: 6 digits
Duodecimal14a022base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal23ce2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:36:58:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1001T1011001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111111110110111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110101010110001100110
Bit length19 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits9within that length
Bit parityeven10 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 53 9a
Gray code1111111101001010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110101010110001100110two's complement
64-bit1111111111111111111111111111111111111111111110101010110001100110two's complement
One's complement00000000000001010101001110011001at 32 bits, every bit flipped
Bits reversed01100110001101010101111111111111at 32 bits
Rotated left by 111111111111101010101100011001101at 32 bits, wrapping
Shifted left by 1-10101010011100110100= -698,164, no wrap
Shifted right by 1-101010100111001101= -174,541, discarding the low bit
These bits as a double1.72469424 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-349,082 to the power 2121,858,242,724
-349,082 to the power 3-42,538,519,086,579,368
-349,082 to the power 414,849,431,319,781,298,940,176
-349,082 to the power 5-5,183,669,183,971,895,396,634,518,432
First ten multiples-349,082, -698,164, -1,047,246, -1,396,328, -1,745,410, -2,094,492, -2,443,574, -2,792,656, -3,141,738, -3,490,820
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 2
Divisible by 100No, remainder 82
As a percentage & fraction
As a percentage-34,908,200%
-349,082% as a decimal-3,490.82
-349,082% of 100-349,082
-349,082% of 1,000-3,490,820
As a fraction of 100-349,082/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -349,082
Nerdulate something else
Nothing in mind? Surprise me · today’s page