Recognised as Number
-130,713
- Negative
- Odd
- 6 digits
-130,713 is an odd 6-digit integer and the negative of 130,713. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,713
Digit count6
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 11 × 17 × 233
Distinct prime factors43, 11, 17, 233
Number of divisors16
Sum of divisors σ(n)202,176
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 17, 33, 51, 187, 233, 561, 699, 2,563, 3,961, 7,689, 11,883, 43,571, 130,71316 in total
Arithmetic
Representations
Decimal-130,713
Binary1111111101001100117 bits
Octal377231
Hexadecimal1FE99
Base 362SUX
In wordsminus one hundred and thirty thousand, seven hundred and thirteen
Ordinalminus one hundred and thirty thousand, seven hundred and thirteenth
Scientific notation-1.30713 × 10^5
Engineering notation-130.713 × 10^3
In other bases
Ternary20122022020base 3; the most digit-efficient integer base after e: 11 digits
Quinary13140323base 5; one hand: 8 digits
Septenary1053042base 7: 7 digits
Nonary218266base 9; each digit is two ternary digits: 6 digits
Duodecimal63789base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg6fdbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:18:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T101T01T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000011010111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000000101100111
Bit length17 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits5within that length
Bit parityeven12 set bits, so even; 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 fe 99
Gray code10000000111010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000000101100111two's complement
64-bit1111111111111111111111111111111111111111111111100000000101100111two's complement
One's complement00000000000000011111111010011000at 32 bits, every bit flipped
Bits reversed11100110100000000111111111111111at 32 bits
Rotated left by 111111111111111000000001011001111at 32 bits, wrapping
Shifted left by 1-111111110100110010= -261,426, no wrap
Shifted right by 1-1111111101001101= -65,356, discarding the low bit
These bits as a double6.45808028 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,713 to the power 217,085,888,369
-130,713 to the power 3-2,233,347,726,377,097
-130,713 to the power 4291,927,581,357,929,480,161
-130,713 to the power 5-38,158,729,942,039,036,140,284,793
First ten multiples-130,713, -261,426, -392,139, -522,852, -653,565, -784,278, -914,991, -1,045,704, -1,176,417, -1,307,130
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 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-13,071,300%
-130,713% as a decimal-1,307.13
-130,713% of 100-130,713
-130,713% of 1,000-1,307,130
As a fraction of 100-130,713/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,713
Nerdulate something else
Nothing in mind? Surprise me · today’s page