Recognised as Number
-130,477
- Negative
- Odd
- 6 digits
-130,477 is an odd 6-digit integer and the negative of 130,477. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,477
Digit count6
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 130,477
Distinct prime factors1130,477
Number of divisors2
Sum of divisors σ(n)130,478
SquarefreeYesno repeated prime factor
All divisors1, 130,4772 in total
Arithmetic
Representations
Decimal-130,477
Binary1111111011010110117 bits
Octal376655
Hexadecimal1FDAD
Base 362SOD
In wordsminus one hundred and thirty thousand, four hundred and seventy-seven
Ordinalminus one hundred and thirty thousand, four hundred and seventy-seventh
Scientific notation-1.30477 × 10^5
Engineering notation-130.477 × 10^3
In other bases
Ternary20121222111base 3; the most digit-efficient integer base after e: 11 digits
Quinary13133402base 5; one hand: 8 digits
Septenary1052254base 7: 7 digits
Nonary217874base 9; each digit is two ternary digits: 6 digits
Duodecimal63611base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg63hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:14:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T101001TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000011001010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000001001010011
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 ad
Gray code10000001101111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000001001010011two's complement
64-bit1111111111111111111111111111111111111111111111100000001001010011two's complement
One's complement00000000000000011111110110101100at 32 bits, every bit flipped
Bits reversed11001010010000000111111111111111at 32 bits
Rotated left by 111111111111111000000010010100111at 32 bits, wrapping
Shifted left by 1-111111101101011010= -260,954, no wrap
Shifted right by 1-1111111011010111= -65,238, discarding the low bit
These bits as a double6.44642033 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,477 to the power 217,024,247,529
-130,477 to the power 3-2,221,272,744,841,333
-130,477 to the power 4289,825,003,928,662,605,841
-130,477 to the power 5-37,815,497,037,600,110,822,316,157
First ten multiples-130,477, -260,954, -391,431, -521,908, -652,385, -782,862, -913,339, -1,043,816, -1,174,293, -1,304,770
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 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 77
As a percentage & fraction
As a percentage-13,047,700%
-130,477% as a decimal-1,304.77
-130,477% of 100-130,477
-130,477% of 1,000-1,304,770
As a fraction of 100-130,477/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,477
Nerdulate something else
Nothing in mind? Surprise me · today’s page