Recognised as Number
-107,477
- Negative
- Odd
- 6 digits
-107,477 is an odd 6-digit integer and the negative of 107,477. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value107,477
Digit count6
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 31 × 3,467
Distinct prime factors231, 3,467
Number of divisors4
Sum of divisors σ(n)110,976
SquarefreeYesno repeated prime factor
All divisors1, 31, 3,467, 107,4774 in total
Arithmetic
Representations
Decimal-107,477
Binary1101000111101010117 bits
Octal321725
Hexadecimal1A3D5
Base 362AXH
In wordsminus one hundred and seven thousand, four hundred and seventy-seven
Ordinalminus one hundred and seven thousand, four hundred and seventy-seventh
Scientific notation-1.07477 × 10^5
Engineering notation-107.477 × 10^3
In other bases
Ternary12110102122base 3; the most digit-efficient integer base after e: 11 digits
Quinary11414402base 5; one hand: 8 digits
Septenary625226base 7: 6 digits
Nonary173378base 9; each digit is two ternary digits: 6 digits
Duodecimal52245base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimald8dhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal29:51:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11TT0TT0101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010110001111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101110000101011
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 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 a3 d5
Gray code10111001000111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101110000101011two's complement
64-bit1111111111111111111111111111111111111111111111100101110000101011two's complement
One's complement00000000000000011010001111010100at 32 bits, every bit flipped
Bits reversed11010100001110100111111111111111at 32 bits
Rotated left by 111111111111111001011100001010111at 32 bits, wrapping
Shifted left by 1-110100011110101010= -214,954, no wrap
Shifted right by 1-1101000111101011= -53,738, discarding the low bit
These bits as a double5.31006934 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-107,477 to the power 211,551,305,529
-107,477 to the power 3-1,241,499,664,340,333
-107,477 to the power 4133,432,659,424,305,969,841
-107,477 to the power 5-14,340,941,936,946,132,720,601,157
First ten multiples-107,477, -214,954, -322,431, -429,908, -537,385, -644,862, -752,339, -859,816, -967,293, -1,074,770
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 77
As a percentage & fraction
As a percentage-10,747,700%
-107,477% as a decimal-1,074.77
-107,477% of 100-107,477
-107,477% of 1,000-1,074,770
As a fraction of 100-107,477/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -107,477
Nerdulate something else
Nothing in mind? Surprise me · today’s page