Recognised as Number
-13,391
- Negative
- Odd
- 5 digits
-13,391 is an odd 5-digit integer and the negative of 13,391. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,391
Digit count5
Digit sum17
Digit product81
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 1,913
Distinct prime factors27, 1,913
Number of divisors4
Sum of divisors σ(n)15,312
SquarefreeYesno repeated prime factor
All divisors1, 7, 1,913, 13,3914 in total
Arithmetic
Representations
Decimal-13,391
Binary1101000100111114 bits
Octal32117
Hexadecimal344F
Base 36ABZ
In wordsminus thirteen thousand, three hundred and ninety-one
Ordinalminus thirteen thousand, three hundred and ninety-first
Scientific notation-1.3391 × 10^4
Engineering notation-13.391 × 10^3
In other bases
Ternary200100222base 3; the most digit-efficient integer base after e: 9 digits
Quinary412031base 5; one hand: 6 digits
Septenary54020base 7: 5 digits
Nonary20328base 9; each digit is two ternary digits: 5 digits
Duodecimal78bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1d9bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:43:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT100T0T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110011110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100101110110001
Bit length14 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits6within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes234 4f
Gray code10111001101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100101110110001two's complement
32-bit11111111111111111100101110110001two's complement
64-bit1111111111111111111111111111111111111111111111111100101110110001two's complement
One's complement0011010001001110at 16 bits, every bit flipped
Bits reversed1000110111010011at 16 bits
Rotated left by 11001011101100011at 16 bits, wrapping
Shifted left by 1-110100010011110= -26,782, no wrap
Shifted right by 1-1101000101000= -6,695, discarding the low bit
These bits as a double6.61603306 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-13,391 to the power 2179,318,881
-13,391 to the power 3-2,401,259,135,471
-13,391 to the power 432,155,261,083,092,161
-13,391 to the power 5-430,591,101,163,687,127,951
First ten multiples-13,391, -26,782, -40,173, -53,564, -66,955, -80,346, -93,737, -107,128, -120,519, -133,910
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
As a percentage & fraction
As a percentage-1,339,100%
-13,391% as a decimal-133.91
-13,391% of 100-13,391
-13,391% of 1,000-133,910
As a fraction of 100-13,391/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -13,391
Nerdulate something else
Nothing in mind? Surprise me · today’s page