Recognised as Number
-150,313
- Negative
- Odd
- 6 digits
-150,313 is an odd 6-digit integer and the negative of 150,313. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value150,313
Digit count6
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 83 × 1,811
Distinct prime factors283, 1,811
Number of divisors4
Sum of divisors σ(n)152,208
SquarefreeYesno repeated prime factor
All divisors1, 83, 1,811, 150,3134 in total
Arithmetic
Representations
Decimal-150,313
Binary10010010110010100118 bits
Octal445451
Hexadecimal24B29
Base 3637ZD
In wordsminus one hundred and fifty thousand, three hundred and thirteen
Ordinalminus one hundred and fifty thousand, three hundred and thirteenth
Scientific notation-1.50313 × 10^5
Engineering notation-150.313 × 10^3
In other bases
Ternary21122012011base 3; the most digit-efficient integer base after e: 11 digits
Quinary14302223base 5; one hand: 8 digits
Septenary1164142base 7: 7 digits
Nonary248164base 9; each digit is two ternary digits: 6 digits
Duodecimal72ba1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaliffdbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal41:45:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01101T110TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111010100101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011011010011010111
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 4b 29
Gray code110110111010111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011011010011010111two's complement
64-bit1111111111111111111111111111111111111111111111011011010011010111two's complement
One's complement00000000000000100100101100101000at 32 bits, every bit flipped
Bits reversed11101011001011011011111111111111at 32 bits
Rotated left by 111111111111110110110100110101111at 32 bits, wrapping
Shifted left by 1-1001001011001010010= -300,626, no wrap
Shifted right by 1-10010010110010101= -75,156, discarding the low bit
These bits as a double7.42644894 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-150,313 to the power 222,593,997,969
-150,313 to the power 3-3,396,171,616,714,297
-150,313 to the power 4510,488,744,223,176,124,961
-150,313 to the power 5-76,733,094,610,418,272,871,262,793
First ten multiples-150,313, -300,626, -450,939, -601,252, -751,565, -901,878, -1,052,191, -1,202,504, -1,352,817, -1,503,130
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-15,031,300%
-150,313% as a decimal-1,503.13
-150,313% of 100-150,313
-150,313% of 1,000-1,503,130
As a fraction of 100-150,313/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -150,313
Nerdulate something else
Nothing in mind? Surprise me · today’s page