Recognised as Number
-130,957
- Negative
- Odd
- 6 digits
-130,957 is an odd 6-digit integer and the negative of 130,957. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,957
Digit count6
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 130,957
Distinct prime factors1130,957
Number of divisors2
Sum of divisors σ(n)130,958
SquarefreeYesno repeated prime factor
All divisors1, 130,9572 in total
Arithmetic
Representations
Decimal-130,957
Binary1111111111000110117 bits
Octal377615
Hexadecimal1FF8D
Base 362T1P
In wordsminus one hundred and thirty thousand, nine hundred and fifty-seven
Ordinalminus one hundred and thirty thousand, nine hundred and fifty-seventh
Scientific notation-1.30957 × 10^5
Engineering notation-130.957 × 10^3
In other bases
Ternary20122122021base 3; the most digit-efficient integer base after e: 11 digits
Quinary13142312base 5; one hand: 8 digits
Septenary1053541base 7: 7 digits
Nonary218567base 9; each digit is two ternary digits: 6 digits
Duodecimal63951base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg77hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:22:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T100101T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000110110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000000001110011
Bit length17 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits4within that length
Bit parityodd13 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 ff 8d
Gray code10000000001001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000000001110011two's complement
64-bit1111111111111111111111111111111111111111111111100000000001110011two's complement
One's complement00000000000000011111111110001100at 32 bits, every bit flipped
Bits reversed11001110000000000111111111111111at 32 bits
Rotated left by 111111111111111000000000011100111at 32 bits, wrapping
Shifted left by 1-111111111100011010= -261,914, no wrap
Shifted right by 1-1111111111000111= -65,478, discarding the low bit
These bits as a double6.47013548 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,957 to the power 217,149,735,849
-130,957 to the power 3-2,245,877,957,577,493
-130,957 to the power 4294,113,439,690,475,750,801
-130,957 to the power 5-38,516,213,721,545,632,897,646,557
First ten multiples-130,957, -261,914, -392,871, -523,828, -654,785, -785,742, -916,699, -1,047,656, -1,178,613, -1,309,570
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 57
As a percentage & fraction
As a percentage-13,095,700%
-130,957% as a decimal-1,309.57
-130,957% of 100-130,957
-130,957% of 1,000-1,309,570
As a fraction of 100-130,957/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,957
Nerdulate something else
Nothing in mind? Surprise me · today’s page