Recognised as Number
-146,341
- Negative
- Odd
- 6 digits
-146,341 is an odd 6-digit integer and the negative of 146,341. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value146,341
Digit count6
Digit sum19
Digit product288
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 13 × 11,257
Distinct prime factors213, 11,257
Number of divisors4
Sum of divisors σ(n)157,612
SquarefreeYesno repeated prime factor
All divisors1, 13, 11,257, 146,3414 in total
Arithmetic
Representations
Decimal-146,341
Binary10001110111010010118 bits
Octal435645
Hexadecimal23BA5
Base 3634X1
In wordsminus one hundred and forty-six thousand, three hundred and forty-one
Ordinalminus one hundred and forty-six thousand, three hundred and forty-first
Scientific notation-1.46341 × 10^5
Engineering notation-146.341 × 10^3
In other bases
Ternary21102202001base 3; the most digit-efficient integer base after e: 11 digits
Quinary14140331base 5; one hand: 8 digits
Septenary1146436base 7: 7 digits
Nonary242661base 9; each digit is two ternary digits: 6 digits
Duodecimal70831base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimali5h1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal40:39:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTT01T100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100010110101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011100010001011011
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 odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 3b a5
Gray code110010011001110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011100010001011011two's complement
64-bit1111111111111111111111111111111111111111111111011100010001011011two's complement
One's complement00000000000000100011101110100100at 32 bits, every bit flipped
Bits reversed11011010001000111011111111111111at 32 bits
Rotated left by 111111111111110111000100010110111at 32 bits, wrapping
Shifted left by 1-1000111011101001010= -292,682, no wrap
Shifted right by 1-10001110111010011= -73,170, discarding the low bit
These bits as a double7.23020607 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-146,341 to the power 221,415,688,281
-146,341 to the power 3-3,133,993,238,729,821
-146,341 to the power 4458,631,704,548,960,734,961
-146,341 to the power 5-67,116,622,275,399,462,914,927,701
First ten multiples-146,341, -292,682, -439,023, -585,364, -731,705, -878,046, -1,024,387, -1,170,728, -1,317,069, -1,463,410
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41
As a percentage & fraction
As a percentage-14,634,100%
-146,341% as a decimal-1,463.41
-146,341% of 100-146,341
-146,341% of 1,000-1,463,410
As a fraction of 100-146,341/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -146,341
Nerdulate something else
Nothing in mind? Surprise me · today’s page