Recognised as Number
-130,479
- Negative
- Odd
- 6 digits
-130,479 is an odd 6-digit integer and the negative of 130,479. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,479
Digit count6
Digit sum24
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 × 23 × 31 × 61
Distinct prime factors43, 23, 31, 61
Number of divisors16
Sum of divisors σ(n)190,464
SquarefreeYesno repeated prime factor
All divisors1, 3, 23, 31, 61, 69, 93, 183, 713, 1,403, 1,891, 2,139, 4,209, 5,673, 43,493, 130,47916 in total
Arithmetic
Representations
Decimal-130,479
Binary1111111011010111117 bits
Octal376657
Hexadecimal1FDAF
Base 362SOF
In wordsminus one hundred and thirty thousand, four hundred and seventy-nine
Ordinalminus one hundred and thirty thousand, four hundred and seventy-ninth
Scientific notation-1.30479 × 10^5
Engineering notation-130.479 × 10^3
In other bases
Ternary20121222120base 3; the most digit-efficient integer base after e: 11 digits
Quinary13133404base 5; one hand: 8 digits
Septenary1052256base 7: 7 digits
Nonary217876base 9; each digit is two ternary digits: 6 digits
Duodecimal63613base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg63jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:14:39base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T101000110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000011001010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000001001010001
Bit length17 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits3within that length
Bit parityeven14 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 fd af
Gray code10000001101111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000001001010001two's complement
64-bit1111111111111111111111111111111111111111111111100000001001010001two's complement
One's complement00000000000000011111110110101110at 32 bits, every bit flipped
Bits reversed10001010010000000111111111111111at 32 bits
Rotated left by 111111111111111000000010010100011at 32 bits, wrapping
Shifted left by 1-111111101101011110= -260,958, no wrap
Shifted right by 1-1111111011011000= -65,239, discarding the low bit
These bits as a double6.44651914 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,479 to the power 217,024,769,441
-130,479 to the power 3-2,221,374,891,892,239
-130,479 to the power 4289,842,774,519,207,452,481
-130,479 to the power 5-37,818,395,376,491,669,192,268,399
First ten multiples-130,479, -260,958, -391,437, -521,916, -652,395, -782,874, -913,353, -1,043,832, -1,174,311, -1,304,790
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 79
As a percentage & fraction
As a percentage-13,047,900%
-130,479% as a decimal-1,304.79
-130,479% of 100-130,479
-130,479% of 1,000-1,304,790
As a fraction of 100-130,479/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,479
Nerdulate something else
Nothing in mind? Surprise me · today’s page