Recognised as Number
-146,185
- Negative
- Odd
- 6 digits
-146,185 is an odd 6-digit integer and the negative of 146,185. It has 12 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value146,185
Digit count6
Digit sum25
Digit product960
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 13^2 × 173
Distinct prime factors35, 13, 173
Number of divisors12
Sum of divisors σ(n)191,052
SquarefreeNohas a repeated prime factor
All divisors1, 5, 13, 65, 169, 173, 845, 865, 2,249, 11,245, 29,237, 146,18512 in total
Arithmetic
Representations
Decimal-146,185
Binary10001110110000100118 bits
Octal435411
Hexadecimal23B09
Base 3634SP
In wordsminus one hundred and forty-six thousand, one hundred and eighty-five
Ordinalminus one hundred and forty-six thousand, one hundred and eighty-fifth
Scientific notation-1.46185 × 10^5
Engineering notation-146.185 × 10^3
In other bases
Ternary21102112021base 3; the most digit-efficient integer base after e: 11 digits
Quinary14134220base 5; one hand: 8 digits
Septenary1146124base 7: 7 digits
Nonary242467base 9; each digit is two ternary digits: 6 digits
Duodecimal70721base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimali595base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal40:36:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTT0111T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100010100001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011100010011110111
Bit length18 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits10within that length
Bit parityeven8 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 09
Gray code110010011010001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011100010011110111two's complement
64-bit1111111111111111111111111111111111111111111111011100010011110111two's complement
One's complement00000000000000100011101100001000at 32 bits, every bit flipped
Bits reversed11101111001000111011111111111111at 32 bits
Rotated left by 111111111111110111000100111101111at 32 bits, wrapping
Shifted left by 1-1000111011000010010= -292,370, no wrap
Shifted right by 1-10001110110000101= -73,092, discarding the low bit
These bits as a double7.22249864 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-146,185 to the power 221,370,054,225
-146,185 to the power 3-3,123,981,376,881,625
-146,185 to the power 4456,679,217,579,440,350,625
-146,185 to the power 5-66,759,651,421,850,487,656,115,625
First ten multiples-146,185, -292,370, -438,555, -584,740, -730,925, -877,110, -1,023,295, -1,169,480, -1,315,665, -1,461,850
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 85
As a percentage & fraction
As a percentage-14,618,500%
-146,185% as a decimal-1,461.85
-146,185% of 100-146,185
-146,185% of 1,000-1,461,850
As a fraction of 100-146,185/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -146,185
Nerdulate something else
Nothing in mind? Surprise me · today’s page