Recognised as Number
-130,993
- Negative
- Odd
- 6 digits
-130,993 is an odd 6-digit integer and the negative of 130,993. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,993
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 × 29 × 4,517
Distinct prime factors229, 4,517
Number of divisors4
Sum of divisors σ(n)135,540
SquarefreeYesno repeated prime factor
All divisors1, 29, 4,517, 130,9934 in total
Arithmetic
Representations
Decimal-130,993
Binary1111111111011000117 bits
Octal377661
Hexadecimal1FFB1
Base 362T2P
In wordsminus one hundred and thirty thousand, nine hundred and ninety-three
Ordinalminus one hundred and thirty thousand, nine hundred and ninety-third
Scientific notation-1.30993 × 10^5
Engineering notation-130.993 × 10^3
In other bases
Ternary20122200121base 3; the most digit-efficient integer base after e: 11 digits
Quinary13142433base 5; one hand: 8 digits
Septenary1053622base 7: 7 digits
Nonary218617base 9; each digit is two ternary digits: 6 digits
Duodecimal63981base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg79dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:23:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T10010T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000001010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000000001001111
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 b1
Gray code10000000001101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000000001001111two's complement
64-bit1111111111111111111111111111111111111111111111100000000001001111two's complement
One's complement00000000000000011111111110110000at 32 bits, every bit flipped
Bits reversed11110010000000000111111111111111at 32 bits
Rotated left by 111111111111111000000000010011111at 32 bits, wrapping
Shifted left by 1-111111111101100010= -261,986, no wrap
Shifted right by 1-1111111111011001= -65,496, discarding the low bit
These bits as a double6.47191411 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,993 to the power 217,159,166,049
-130,993 to the power 3-2,247,730,638,256,657
-130,993 to the power 4294,436,979,497,154,270,401
-130,993 to the power 5-38,569,183,255,270,729,342,638,193
First ten multiples-130,993, -261,986, -392,979, -523,972, -654,965, -785,958, -916,951, -1,047,944, -1,178,937, -1,309,930
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 93
As a percentage & fraction
As a percentage-13,099,300%
-130,993% as a decimal-1,309.93
-130,993% of 100-130,993
-130,993% of 1,000-1,309,930
As a fraction of 100-130,993/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,993
Nerdulate something else
Nothing in mind? Surprise me · today’s page