Recognised as Number
-13,817
- Negative
- Odd
- 5 digits
-13,817 is an odd 5-digit integer and the negative of 13,817. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,817
Digit count5
Digit sum20
Digit product168
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 41 × 337
Distinct prime factors241, 337
Number of divisors4
Sum of divisors σ(n)14,196
SquarefreeYesno repeated prime factor
All divisors1, 41, 337, 13,8174 in total
Arithmetic
Representations
Decimal-13,817
Binary1101011111100114 bits
Octal32771
Hexadecimal35F9
Base 36ANT
In wordsminus thirteen thousand, eight hundred and seventeen
Ordinalminus thirteen thousand, eight hundred and seventeenth
Scientific notation-1.3817 × 10^4
Engineering notation-13.817 × 10^3
In other bases
Ternary200221202base 3; the most digit-efficient integer base after e: 9 digits
Quinary420232base 5; one hand: 6 digits
Septenary55166base 7: 5 digits
Nonary20852base 9; each digit is two ternary digits: 5 digits
Duodecimal7bb5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1eahbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:50:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10T0011T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100101000000111
Bit length14 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits4within that length
Bit parityeven10 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
Bytes235 f9
Gray code10111100000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100101000000111two's complement
32-bit11111111111111111100101000000111two's complement
64-bit1111111111111111111111111111111111111111111111111100101000000111two's complement
One's complement0011010111111000at 16 bits, every bit flipped
Bits reversed1110000001010011at 16 bits
Rotated left by 11001010000001111at 16 bits, wrapping
Shifted left by 1-110101111110010= -27,634, no wrap
Shifted right by 1-1101011111101= -6,908, discarding the low bit
These bits as a double6.82650503 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-13,817 to the power 2190,909,489
-13,817 to the power 3-2,637,796,409,513
-13,817 to the power 436,446,432,990,241,121
-13,817 to the power 5-503,580,364,626,161,568,857
First ten multiples-13,817, -27,634, -41,451, -55,268, -69,085, -82,902, -96,719, -110,536, -124,353, -138,170
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 17
As a percentage & fraction
As a percentage-1,381,700%
-13,817% as a decimal-138.17
-13,817% of 100-13,817
-13,817% of 1,000-138,170
As a fraction of 100-13,817/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -13,817
Nerdulate something else
Nothing in mind? Surprise me · today’s page