Recognised as Number
-150,130
- Negative
- Even
- 6 digits
-150,130 is an even 6-digit integer and the negative of 150,130. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value150,130
Digit count6
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5 × 15,013
Distinct prime factors32, 5, 15,013
Number of divisors8
Sum of divisors σ(n)270,252
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 15,013, 30,026, 75,065, 150,1308 in total
Arithmetic
Representations
Decimal-150,130
Binary10010010100111001018 bits
Octal445162
Hexadecimal24A72
Base 3637UA
In wordsminus one hundred and fifty thousand, one hundred and thirty
Ordinalminus one hundred and fifty thousand, one hundred and thirtieth
Scientific notation-1.5013 × 10^5
Engineering notation-150.13 × 10^3
In other bases
Ternary21121221101base 3; the most digit-efficient integer base after e: 11 digits
Quinary14301010base 5; one hand: 8 digits
Septenary1163461base 7: 7 digits
Nonary247841base 9; each digit is two ternary digits: 6 digits
Duodecimal72a6abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalif6abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal41:42:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0110101TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100101010010010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011011010110001110
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 even
Highest set bitbit 17worth 131,072
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes302 4a 72
Gray code110110111101001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011011010110001110two's complement
64-bit1111111111111111111111111111111111111111111111011011010110001110two's complement
One's complement00000000000000100100101001110001at 32 bits, every bit flipped
Bits reversed01110001101011011011111111111111at 32 bits
Rotated left by 111111111111110110110101100011101at 32 bits, wrapping
Shifted left by 1-1001001010011100100= -300,260, no wrap
Shifted right by 1-10010010100111001= -75,065, discarding the low bit
These bits as a double7.41740754 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-150,130 to the power 222,539,016,900
-150,130 to the power 3-3,383,782,607,197,000
-150,130 to the power 4508,007,282,818,485,610,000
-150,130 to the power 5-76,267,133,369,539,244,629,300,000
First ten multiples-150,130, -300,260, -450,390, -600,520, -750,650, -900,780, -1,050,910, -1,201,040, -1,351,170, -1,501,300
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 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 30
As a percentage & fraction
As a percentage-15,013,000%
-150,130% as a decimal-1,501.3
-150,130% of 100-150,130
-150,130% of 1,000-1,501,300
As a fraction of 100-150,130/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -150,130
Nerdulate something else
Nothing in mind? Surprise me · today’s page