Recognised as Number
-106,951
- Negative
- Odd
- 6 digits
-106,951 is an odd 6-digit integer and the negative of 106,951. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value106,951
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 × 13 × 19 × 433
Distinct prime factors313, 19, 433
Number of divisors8
Sum of divisors σ(n)121,520
SquarefreeYesno repeated prime factor
All divisors1, 13, 19, 247, 433, 5,629, 8,227, 106,9518 in total
Arithmetic
Representations
Decimal-106,951
Binary1101000011100011117 bits
Octal320707
Hexadecimal1A1C7
Base 362AIV
In wordsminus one hundred and six thousand, nine hundred and fifty-one
Ordinalminus one hundred and six thousand, nine hundred and fifty-first
Scientific notation-1.06951 × 10^5
Engineering notation-106.951 × 10^3
In other bases
Ternary12102201011base 3; the most digit-efficient integer base after e: 11 digits
Quinary11410301base 5; one hand: 8 digits
Septenary623545base 7: 6 digits
Nonary172634base 9; each digit is two ternary digits: 6 digits
Duodecimal51a87base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimald77bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal29:42:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11TT010T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010001001001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101111000111001
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 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 a1 c7
Gray code10111000100100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101111000111001two's complement
64-bit1111111111111111111111111111111111111111111111100101111000111001two's complement
One's complement00000000000000011010000111000110at 32 bits, every bit flipped
Bits reversed10011100011110100111111111111111at 32 bits
Rotated left by 111111111111111001011110001110011at 32 bits, wrapping
Shifted left by 1-110100001110001110= -213,902, no wrap
Shifted right by 1-1101000011100100= -53,475, discarding the low bit
These bits as a double5.28408149 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-106,951 to the power 211,438,516,401
-106,951 to the power 3-1,223,360,767,603,351
-106,951 to the power 4130,839,657,455,945,992,801
-106,951 to the power 5-13,993,432,204,570,879,876,059,751
First ten multiples-106,951, -213,902, -320,853, -427,804, -534,755, -641,706, -748,657, -855,608, -962,559, -1,069,510
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-10,695,100%
-106,951% as a decimal-1,069.51
-106,951% of 100-106,951
-106,951% of 1,000-1,069,510
As a fraction of 100-106,951/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -106,951
Nerdulate something else
Nothing in mind? Surprise me · today’s page