Recognised as Number
-130,475
- Negative
- Odd
- 6 digits
-130,475 is an odd 6-digit integer and the negative of 130,475. It has 12 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,475
Digit count6
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5^2 × 17 × 307
Distinct prime factors35, 17, 307
Number of divisors12
Sum of divisors σ(n)171,864
SquarefreeNohas a repeated prime factor
All divisors1, 5, 17, 25, 85, 307, 425, 1,535, 5,219, 7,675, 26,095, 130,47512 in total
Arithmetic
Representations
Decimal-130,475
Binary1111111011010101117 bits
Octal376653
Hexadecimal1FDAB
Base 362SOB
In wordsminus one hundred and thirty thousand, four hundred and seventy-five
Ordinalminus one hundred and thirty thousand, four hundred and seventy-fifth
Scientific notation-1.30475 × 10^5
Engineering notation-130.475 × 10^3
In other bases
Ternary20121222102base 3; the most digit-efficient integer base after e: 11 digits
Quinary13133400base 5; one hand: 8 digits
Septenary1052252base 7: 7 digits
Nonary217872base 9; each digit is two ternary digits: 6 digits
Duodecimal6360bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg63fbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:14:35base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T101001TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000011001010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000001001010101
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 fd ab
Gray code10000001101111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000001001010101two's complement
64-bit1111111111111111111111111111111111111111111111100000001001010101two's complement
One's complement00000000000000011111110110101010at 32 bits, every bit flipped
Bits reversed10101010010000000111111111111111at 32 bits
Rotated left by 111111111111111000000010010101011at 32 bits, wrapping
Shifted left by 1-111111101101010110= -260,950, no wrap
Shifted right by 1-1111111011010110= -65,237, discarding the low bit
These bits as a double6.44632151 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,475 to the power 217,023,725,625
-130,475 to the power 3-2,221,170,600,921,875
-130,475 to the power 4289,807,234,155,281,640,625
-130,475 to the power 5-37,812,598,876,410,372,060,546,875
First ten multiples-130,475, -260,950, -391,425, -521,900, -652,375, -782,850, -913,325, -1,043,800, -1,174,275, -1,304,750
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 75
As a percentage & fraction
As a percentage-13,047,500%
-130,475% as a decimal-1,304.75
-130,475% of 100-130,475
-130,475% of 1,000-1,304,750
As a fraction of 100-130,475/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,475
Nerdulate something else
Nothing in mind? Surprise me · today’s page