Recognised as Number
-26,009
- Negative
- Odd
- 5 digits
-26,009 is an odd 5-digit integer and the negative of 26,009. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value26,009
Digit count5
Digit sum17
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 × 839
Distinct prime factors231, 839
Number of divisors4
Sum of divisors σ(n)26,880
SquarefreeYesno repeated prime factor
All divisors1, 31, 839, 26,0094 in total
Arithmetic
Representations
Decimal-26,009
Binary11001011001100115 bits
Octal62631
Hexadecimal6599
Base 36K2H
In wordsminus twenty-six thousand and nine
Ordinalminus twenty-six thousand and ninth
Scientific notation-2.6009 × 10^4
Engineering notation-26.009 × 10^3
In other bases
Ternary1022200022base 3; the most digit-efficient integer base after e: 10 digits
Quinary1313014base 5; one hand: 7 digits
Septenary135554base 7: 6 digits
Nonary38608base 9; each digit is two ternary digits: 5 digits
Duodecimal13075base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3509base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:13:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT00100T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110111110111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001101001100111
Bit length15 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits7within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes265 99
Gray code101011101010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001101001100111two's complement
32-bit11111111111111111001101001100111two's complement
64-bit1111111111111111111111111111111111111111111111111001101001100111two's complement
One's complement0110010110011000at 16 bits, every bit flipped
Bits reversed1110011001011001at 16 bits
Rotated left by 10011010011001111at 16 bits, wrapping
Shifted left by 1-1100101100110010= -52,018, no wrap
Shifted right by 1-11001011001101= -13,004, discarding the low bit
These bits as a double1.28501534 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-26,009 to the power 2676,468,081
-26,009 to the power 3-17,594,258,318,729
-26,009 to the power 4457,609,064,611,822,561
-26,009 to the power 5-11,901,954,161,488,892,989,049
First ten multiples-26,009, -52,018, -78,027, -104,036, -130,045, -156,054, -182,063, -208,072, -234,081, -260,090
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-2,600,900%
-26,009% as a decimal-260.09
-26,009% of 100-26,009
-26,009% of 1,000-260,090
As a fraction of 100-26,009/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -26,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page