Recognised as Number
-26,113
- Negative
- Odd
- 5 digits
-26,113 is an odd 5-digit integer and the negative of 26,113. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value26,113
Digit count5
Digit sum13
Digit product36
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 26,113
Distinct prime factors126,113
Number of divisors2
Sum of divisors σ(n)26,114
SquarefreeYesno repeated prime factor
All divisors1, 26,1132 in total
Arithmetic
Representations
Decimal-26,113
Binary11001100000000115 bits
Octal63001
Hexadecimal6601
Base 36K5D
In wordsminus twenty-six thousand, one hundred and thirteen
Ordinalminus twenty-six thousand, one hundred and thirteenth
Scientific notation-2.6113 × 10^4
Engineering notation-26.113 × 10^3
In other bases
Ternary1022211011base 3; the most digit-efficient integer base after e: 10 digits
Quinary1313423base 5; one hand: 7 digits
Septenary136063base 7: 6 digits
Nonary38734base 9; each digit is two ternary digits: 5 digits
Duodecimal13141base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal355dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:15:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT001TT0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110111000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001100111111111
Bit length15 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits10within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes266 01
Gray code101010100000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001100111111111two's complement
32-bit11111111111111111001100111111111two's complement
64-bit1111111111111111111111111111111111111111111111111001100111111111two's complement
One's complement0110011000000000at 16 bits, every bit flipped
Bits reversed1111111110011001at 16 bits
Rotated left by 10011001111111111at 16 bits, wrapping
Shifted left by 1-1100110000000010= -52,226, no wrap
Shifted right by 1-11001100000001= -13,056, discarding the low bit
These bits as a double1.29015362 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-26,113 to the power 2681,888,769
-26,113 to the power 3-17,806,161,424,897
-26,113 to the power 4464,972,293,288,335,361
-26,113 to the power 5-12,141,821,494,638,301,281,793
First ten multiples-26,113, -52,226, -78,339, -104,452, -130,565, -156,678, -182,791, -208,904, -235,017, -261,130
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-2,611,300%
-26,113% as a decimal-261.13
-26,113% of 100-26,113
-26,113% of 1,000-261,130
As a fraction of 100-26,113/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -26,113
Nerdulate something else
Nothing in mind? Surprise me · today’s page