Recognised as Number
-13,765
- Negative
- Odd
- 5 digits
-13,765 is an odd 5-digit integer and the negative of 13,765. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,765
Digit count5
Digit sum22
Digit product630
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 2,753
Distinct prime factors25, 2,753
Number of divisors4
Sum of divisors σ(n)16,524
SquarefreeYesno repeated prime factor
All divisors1, 5, 2,753, 13,7654 in total
Arithmetic
Representations
Decimal-13,765
Binary1101011100010114 bits
Octal32705
Hexadecimal35C5
Base 36AMD
In wordsminus thirteen thousand, seven hundred and sixty-five
Ordinalminus thirteen thousand, seven hundred and sixty-fifth
Scientific notation-1.3765 × 10^4
Engineering notation-13.765 × 10^3
In other bases
Ternary200212211base 3; the most digit-efficient integer base after e: 9 digits
Quinary420030base 5; one hand: 6 digits
Septenary55063base 7: 5 digits
Nonary20784base 9; each digit is two ternary digits: 5 digits
Duodecimal7b71base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1e85base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:49:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10T0101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111001001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100101000111011
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
Bytes235 c5
Gray code10111100100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100101000111011two's complement
32-bit11111111111111111100101000111011two's complement
64-bit1111111111111111111111111111111111111111111111111100101000111011two's complement
One's complement0011010111000100at 16 bits, every bit flipped
Bits reversed1101110001010011at 16 bits
Rotated left by 11001010001110111at 16 bits, wrapping
Shifted left by 1-110101110001010= -27,530, no wrap
Shifted right by 1-1101011100011= -6,882, discarding the low bit
These bits as a double6.80081362 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-13,765 to the power 2189,475,225
-13,765 to the power 3-2,608,126,472,125
-13,765 to the power 435,900,860,888,800,625
-13,765 to the power 5-494,175,350,134,340,603,125
First ten multiples-13,765, -27,530, -41,295, -55,060, -68,825, -82,590, -96,355, -110,120, -123,885, -137,650
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 65
As a percentage & fraction
As a percentage-1,376,500%
-13,765% as a decimal-137.65
-13,765% of 100-13,765
-13,765% of 1,000-137,650
As a fraction of 100-13,765/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -13,765
Nerdulate something else
Nothing in mind? Surprise me · today’s page