Recognised as Number
-130,057
- Negative
- Odd
- 6 digits
-130,057 is an odd 6-digit integer and the negative of 130,057. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,057
Digit count6
Digit sum16
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,057
Distinct prime factors1130,057
Number of divisors2
Sum of divisors σ(n)130,058
SquarefreeYesno repeated prime factor
All divisors1, 130,0572 in total
Arithmetic
Representations
Decimal-130,057
Binary1111111000000100117 bits
Octal376011
Hexadecimal1FC09
Base 362SCP
In wordsminus one hundred and thirty thousand and fifty-seven
Ordinalminus one hundred and thirty thousand and fifty-seventh
Scientific notation-1.30057 × 10^5
Engineering notation-130.057 × 10^3
In other bases
Ternary20121101221base 3; the most digit-efficient integer base after e: 11 digits
Quinary13130212base 5; one hand: 8 digits
Septenary1051114base 7: 7 digits
Nonary217357base 9; each digit is two ternary digits: 6 digits
Duodecimal63321base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg52hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:7:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T11TTT101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000010000001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000001111110111
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 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 09
Gray code10000001000001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000001111110111two's complement
64-bit1111111111111111111111111111111111111111111111100000001111110111two's complement
One's complement00000000000000011111110000001000at 32 bits, every bit flipped
Bits reversed11101111110000000111111111111111at 32 bits
Rotated left by 111111111111111000000011111101111at 32 bits, wrapping
Shifted left by 1-111111100000010010= -260,114, no wrap
Shifted right by 1-1111111000000101= -65,028, discarding the low bit
These bits as a double6.42566957 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,057 to the power 216,914,823,249
-130,057 to the power 3-2,199,891,167,295,193
-130,057 to the power 4286,111,245,544,910,916,001
-130,057 to the power 5-37,210,770,261,834,479,002,342,057
First ten multiples-130,057, -260,114, -390,171, -520,228, -650,285, -780,342, -910,399, -1,040,456, -1,170,513, -1,300,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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 57
As a percentage & fraction
As a percentage-13,005,700%
-130,057% as a decimal-1,300.57
-130,057% of 100-130,057
-130,057% of 1,000-1,300,570
As a fraction of 100-130,057/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,057
Nerdulate something else
Nothing in mind? Surprise me · today’s page