Recognised as Number
-242,146
- Negative
- Even
- 6 digits
-242,146 is an even 6-digit integer and the negative of 242,146. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value242,146
Digit count6
Digit sum19
Digit product384
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 41 × 2,953
Distinct prime factors32, 41, 2,953
Number of divisors8
Sum of divisors σ(n)372,204
SquarefreeYesno repeated prime factor
All divisors1, 2, 41, 82, 2,953, 5,906, 121,073, 242,1468 in total
Arithmetic
Representations
Decimal-242,146
Binary11101100011110001018 bits
Octal730742
Hexadecimal3B1E2
Base 3656UA
In wordsminus two hundred and forty-two thousand, one hundred and forty-six
Ordinalminus two hundred and forty-two thousand, one hundred and forty-sixth
Scientific notation-2.42146 × 10^5
Engineering notation-242.146 × 10^3
In other bases
Ternary110022011101base 3; the most digit-efficient integer base after e: 12 digits
Quinary30222041base 5; one hand: 8 digits
Septenary2025652base 7: 7 digits
Nonary408141base 9; each digit is two ternary digits: 6 digits
Duodecimalb816abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal1a576base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:7:15:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryTT0T010TTT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000101001001100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111000100111000011110
Bit length18 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits8within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 17worth 131,072
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes303 b1 e2
Gray code100110100100010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111000100111000011110two's complement
64-bit1111111111111111111111111111111111111111111111000100111000011110two's complement
One's complement00000000000000111011000111100001at 32 bits, every bit flipped
Bits reversed01111000011100100011111111111111at 32 bits
Rotated left by 111111111111110001001110000111101at 32 bits, wrapping
Shifted left by 1-1110110001111000100= -484,292, no wrap
Shifted right by 1-11101100011110001= -121,073, discarding the low bit
These bits as a double1.1963602 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-242,146 to the power 258,634,685,316
-242,146 to the power 3-14,198,154,510,528,136
-242,146 to the power 43,438,026,322,106,346,019,856
-242,146 to the power 5-832,504,321,792,763,263,324,050,976
First ten multiples-242,146, -484,292, -726,438, -968,584, -1,210,730, -1,452,876, -1,695,022, -1,937,168, -2,179,314, -2,421,460
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 46
As a percentage & fraction
As a percentage-24,214,600%
-242,146% as a decimal-2,421.46
-242,146% of 100-242,146
-242,146% of 1,000-2,421,460
As a fraction of 100-242,146/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -242,146
Nerdulate something else
Nothing in mind? Surprise me · today’s page