Recognised as Number
-26,431
- Negative
- Odd
- 5 digits
-26,431 is an odd 5-digit integer and the negative of 26,431. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value26,431
Digit count5
Digit sum16
Digit product144
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 26,431
Distinct prime factors126,431
Number of divisors2
Sum of divisors σ(n)26,432
SquarefreeYesno repeated prime factor
All divisors1, 26,4312 in total
Arithmetic
Representations
Decimal-26,431
Binary11001110011111115 bits
Octal63477
Hexadecimal673F
Base 36KE7
In wordsminus twenty-six thousand, four hundred and thirty-one
Ordinalminus twenty-six thousand, four hundred and thirty-first
Scientific notation-2.6431 × 10^4
Engineering notation-26.431 × 10^3
In other bases
Ternary1100020221base 3; the most digit-efficient integer base after e: 10 digits
Quinary1321211base 5; one hand: 7 digits
Septenary140026base 7: 6 digits
Nonary40227base 9; each digit is two ternary digits: 5 digits
Duodecimal13367base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal361bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:20:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT00T1T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110100111000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001100011000001
Bit length15 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits4within that length
Bit parityodd11 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
Bytes267 3f
Gray code101010010100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001100011000001two's complement
32-bit11111111111111111001100011000001two's complement
64-bit1111111111111111111111111111111111111111111111111001100011000001two's complement
One's complement0110011100111110at 16 bits, every bit flipped
Bits reversed1000001100011001at 16 bits
Rotated left by 10011000110000011at 16 bits, wrapping
Shifted left by 1-1100111001111110= -52,862, no wrap
Shifted right by 1-11001110100000= -13,215, discarding the low bit
These bits as a double1.30586491 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-26,431 to the power 2698,597,761
-26,431 to the power 3-18,464,637,420,991
-26,431 to the power 4488,038,831,674,213,121
-26,431 to the power 5-12,899,354,359,981,127,001,151
First ten multiples-26,431, -52,862, -79,293, -105,724, -132,155, -158,586, -185,017, -211,448, -237,879, -264,310
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
As a percentage & fraction
As a percentage-2,643,100%
-26,431% as a decimal-264.31
-26,431% of 100-26,431
-26,431% of 1,000-264,310
As a fraction of 100-26,431/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -26,431
Nerdulate something else
Nothing in mind? Surprise me · today’s page