Recognised as Number
-130,425
- Negative
- Odd
- 6 digits
-130,425 is an odd 6-digit integer and the negative of 130,425. It has 24 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,425
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 × 5^2 × 37 × 47
Distinct prime factors43, 5, 37, 47
Number of divisors24
Sum of divisors σ(n)226,176
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 15, 25, 37, 47, 75, 111, 141, 185, 235, 555, 705, 925, 1,175, 1,739, 2,775, 3,525, 5,217, 8,695, 26,085, 43,475, 130,42524 in total
Arithmetic
Representations
Decimal-130,425
Binary1111111010111100117 bits
Octal376571
Hexadecimal1FD79
Base 362SMX
In wordsminus one hundred and thirty thousand, four hundred and twenty-five
Ordinalminus one hundred and thirty thousand, four hundred and twenty-fifth
Scientific notation-1.30425 × 10^5
Engineering notation-130.425 × 10^3
In other bases
Ternary20121220120base 3; the most digit-efficient integer base after e: 11 digits
Quinary13133200base 5; one hand: 8 digits
Septenary1052151base 7: 7 digits
Nonary217816base 9; each digit is two ternary digits: 6 digits
Duodecimal63589base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg615base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:13:45base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T10101T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000011110011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000001010000111
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 79
Gray code10000001111000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000001010000111two's complement
64-bit1111111111111111111111111111111111111111111111100000001010000111two's complement
One's complement00000000000000011111110101111000at 32 bits, every bit flipped
Bits reversed11100001010000000111111111111111at 32 bits
Rotated left by 111111111111111000000010100001111at 32 bits, wrapping
Shifted left by 1-111111101011110010= -260,850, no wrap
Shifted right by 1-1111111010111101= -65,212, discarding the low bit
These bits as a double6.44385119 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,425 to the power 217,010,680,625
-130,425 to the power 3-2,218,618,020,515,625
-130,425 to the power 4289,363,255,325,750,390,625
-130,425 to the power 5-37,740,202,575,860,994,697,265,625
First ten multiples-130,425, -260,850, -391,275, -521,700, -652,125, -782,550, -912,975, -1,043,400, -1,173,825, -1,304,250
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 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 25
As a percentage & fraction
As a percentage-13,042,500%
-130,425% as a decimal-1,304.25
-130,425% of 100-130,425
-130,425% of 1,000-1,304,250
As a fraction of 100-130,425/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,425
Nerdulate something else
Nothing in mind? Surprise me · today’s page