Recognised as Number
-150,311
- Negative
- Odd
- 6 digits
-150,311 is an odd 6-digit integer and the negative of 150,311. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value150,311
Digit count6
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 109 × 197
Distinct prime factors37, 109, 197
Number of divisors8
Sum of divisors σ(n)174,240
SquarefreeYesno repeated prime factor
All divisors1, 7, 109, 197, 763, 1,379, 21,473, 150,3118 in total
Arithmetic
Representations
Decimal-150,311
Binary10010010110010011118 bits
Octal445447
Hexadecimal24B27
Base 3637ZB
In wordsminus one hundred and fifty thousand, three hundred and eleven
Ordinalminus one hundred and fifty thousand, three hundred and eleventh
Scientific notation-1.50311 × 10^5
Engineering notation-150.311 × 10^3
In other bases
Ternary21122012002base 3; the most digit-efficient integer base after e: 11 digits
Quinary14302221base 5; one hand: 8 digits
Septenary1164140base 7: 7 digits
Nonary248162base 9; each digit is two ternary digits: 6 digits
Duodecimal72b9bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaliffbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal41:45:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01101T110T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111010100101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011011010011011001
Bit length18 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits9within that length
Bit parityodd9 set bits, so odd; 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 4b 27
Gray code110110111010110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011011010011011001two's complement
64-bit1111111111111111111111111111111111111111111111011011010011011001two's complement
One's complement00000000000000100100101100100110at 32 bits, every bit flipped
Bits reversed10011011001011011011111111111111at 32 bits
Rotated left by 111111111111110110110100110110011at 32 bits, wrapping
Shifted left by 1-1001001011001001110= -300,622, no wrap
Shifted right by 1-10010010110010100= -75,155, discarding the low bit
These bits as a double7.42635013 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-150,311 to the power 222,593,396,721
-150,311 to the power 3-3,396,036,054,530,231
-150,311 to the power 4510,461,575,392,493,551,841
-150,311 to the power 5-76,727,989,858,821,098,270,772,551
First ten multiples-150,311, -300,622, -450,933, -601,244, -751,555, -901,866, -1,052,177, -1,202,488, -1,352,799, -1,503,110
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-15,031,100%
-150,311% as a decimal-1,503.11
-150,311% of 100-150,311
-150,311% of 1,000-1,503,110
As a fraction of 100-150,311/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -150,311
Nerdulate something else
Nothing in mind? Surprise me · today’s page