Recognised as Number
-130,197
- Negative
- Odd
- 6 digits
-130,197 is an odd 6-digit integer and the negative of 130,197. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,197
Digit count6
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 43,399
Distinct prime factors23, 43,399
Number of divisors4
Sum of divisors σ(n)173,600
SquarefreeYesno repeated prime factor
All divisors1, 3, 43,399, 130,1974 in total
Arithmetic
Representations
Decimal-130,197
Binary1111111001001010117 bits
Octal376225
Hexadecimal1FC95
Base 362SGL
In wordsminus one hundred and thirty thousand, one hundred and ninety-seven
Ordinalminus one hundred and thirty thousand, one hundred and ninety-seventh
Scientific notation-1.30197 × 10^5
Engineering notation-130.197 × 10^3
In other bases
Ternary20121121010base 3; the most digit-efficient integer base after e: 11 digits
Quinary13131242base 5; one hand: 8 digits
Septenary1051404base 7: 7 digits
Nonary217533base 9; each digit is two ternary digits: 6 digits
Duodecimal63419base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg59hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:9:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T10111T0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000010010111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000001101101011
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 fc 95
Gray code10000001011011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000001101101011two's complement
64-bit1111111111111111111111111111111111111111111111100000001101101011two's complement
One's complement00000000000000011111110010010100at 32 bits, every bit flipped
Bits reversed11010110110000000111111111111111at 32 bits
Rotated left by 111111111111111000000011011010111at 32 bits, wrapping
Shifted left by 1-111111100100101010= -260,394, no wrap
Shifted right by 1-1111111001001011= -65,098, discarding the low bit
These bits as a double6.43258649 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,197 to the power 216,951,258,809
-130,197 to the power 3-2,207,003,043,155,373
-130,197 to the power 4287,345,175,209,700,098,481
-130,197 to the power 5-37,411,479,776,777,323,721,930,757
First ten multiples-130,197, -260,394, -390,591, -520,788, -650,985, -781,182, -911,379, -1,041,576, -1,171,773, -1,301,970
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 97
As a percentage & fraction
As a percentage-13,019,700%
-130,197% as a decimal-1,301.97
-130,197% of 100-130,197
-130,197% of 1,000-1,301,970
As a fraction of 100-130,197/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,197
Nerdulate something else
Nothing in mind? Surprise me · today’s page