Recognised as Number
-20,693
- Negative
- Odd
- 5 digits
-20,693 is an odd 5-digit integer and the negative of 20,693. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value20,693
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 20,693
Distinct prime factors120,693
Number of divisors2
Sum of divisors σ(n)20,694
SquarefreeYesno repeated prime factor
All divisors1, 20,6932 in total
Arithmetic
Representations
Decimal-20,693
Binary10100001101010115 bits
Octal50325
Hexadecimal50D5
Base 36FYT
In wordsminus twenty thousand, six hundred and ninety-three
Ordinalminus twenty thousand, six hundred and ninety-third
Scientific notation-2.0693 × 10^4
Engineering notation-20.693 × 10^3
In other bases
Ternary1001101102base 3; the most digit-efficient integer base after e: 10 digits
Quinary1130233base 5; one hand: 7 digits
Septenary114221base 7: 6 digits
Nonary31342base 9; each digit is two ternary digits: 5 digits
Duodecimalbb85base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal2bedbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:44:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT00TT0TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111001101111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010111100101011
Bit length15 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits8within that length
Bit parityodd7 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
Bytes250 d5
Gray code111100010111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010111100101011two's complement
32-bit11111111111111111010111100101011two's complement
64-bit1111111111111111111111111111111111111111111111111010111100101011two's complement
One's complement0101000011010100at 16 bits, every bit flipped
Bits reversed1101010011110101at 16 bits
Rotated left by 10101111001010111at 16 bits, wrapping
Shifted left by 1-1010000110101010= -41,386, no wrap
Shifted right by 1-10100001101011= -10,346, discarding the low bit
These bits as a double1.02237004 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-20,693 to the power 2428,200,249
-20,693 to the power 3-8,860,747,752,557
-20,693 to the power 4183,355,453,243,662,001
-20,693 to the power 5-3,794,174,393,971,097,786,693
First ten multiples-20,693, -41,386, -62,079, -82,772, -103,465, -124,158, -144,851, -165,544, -186,237, -206,930
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93
As a percentage & fraction
As a percentage-2,069,300%
-20,693% as a decimal-206.93
-20,693% of 100-20,693
-20,693% of 1,000-206,930
As a fraction of 100-20,693/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -20,693
Nerdulate something else
Nothing in mind? Surprise me · today’s page