Recognised as Number
-130,311
- Negative
- Odd
- 6 digits
-130,311 is an odd 6-digit integer and the negative of 130,311. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,311
Digit count6
Digit sum9
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 14,479
Distinct prime factors23, 14,479
Number of divisors6
Sum of divisors σ(n)188,240
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 14,479, 43,437, 130,3116 in total
Arithmetic
Representations
Decimal-130,311
Binary1111111010000011117 bits
Octal376407
Hexadecimal1FD07
Base 362SJR
In wordsminus one hundred and thirty thousand, three hundred and eleven
Ordinalminus one hundred and thirty thousand, three hundred and eleventh
Scientific notation-1.30311 × 10^5
Engineering notation-130.311 × 10^3
In other bases
Ternary20121202100base 3; the most digit-efficient integer base after e: 11 digits
Quinary13132221base 5; one hand: 8 digits
Septenary1051626base 7: 7 digits
Nonary217670base 9; each digit is two ternary digits: 6 digits
Duodecimal634b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg5fbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:11:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1011T1T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000011100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000001011111001
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 fd 07
Gray code10000001110000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000001011111001two's complement
64-bit1111111111111111111111111111111111111111111111100000001011111001two's complement
One's complement00000000000000011111110100000110at 32 bits, every bit flipped
Bits reversed10011111010000000111111111111111at 32 bits
Rotated left by 111111111111111000000010111110011at 32 bits, wrapping
Shifted left by 1-111111101000001110= -260,622, no wrap
Shifted right by 1-1111111010000100= -65,155, discarding the low bit
These bits as a double6.43821884 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,311 to the power 216,980,956,721
-130,311 to the power 3-2,212,805,451,270,231
-130,311 to the power 4288,352,891,160,475,071,841
-130,311 to the power 5-37,575,553,600,012,667,086,672,551
First ten multiples-130,311, -260,622, -390,933, -521,244, -651,555, -781,866, -912,177, -1,042,488, -1,172,799, -1,303,110
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-13,031,100%
-130,311% as a decimal-1,303.11
-130,311% of 100-130,311
-130,311% of 1,000-1,303,110
As a fraction of 100-130,311/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,311
Nerdulate something else
Nothing in mind? Surprise me · today’s page