Recognised as Number
-53,739
- Negative
- Odd
- 5 digits
-53,739 is an odd 5-digit integer and the negative of 53,739. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value53,739
Digit count5
Digit sum27
Digit product2,835
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 7 × 853
Distinct prime factors33, 7, 853
Number of divisors12
Sum of divisors σ(n)88,816
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 63, 853, 2,559, 5,971, 7,677, 17,913, 53,73912 in total
Arithmetic
Representations
Decimal-53,739
Binary110100011110101116 bits
Octal150753
HexadecimalD1EB
Base 3615GR
In wordsminus fifty-three thousand, seven hundred and thirty-nine
Ordinalminus fifty-three thousand, seven hundred and thirty-ninth
Scientific notation-5.3739 × 10^4
Engineering notation-53.739 × 10^3
In other bases
Ternary2201201100base 3; the most digit-efficient integer base after e: 10 digits
Quinary3204424base 5; one hand: 7 digits
Septenary312450base 7: 6 digits
Nonary81640base 9; each digit is two ternary digits: 5 digits
Duodecimal27123base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6e6jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:55:39base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01T110TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110111001000010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110010111000010101
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2d1 eb
Gray code1011100100011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110010111000010101two's complement
64-bit1111111111111111111111111111111111111111111111110010111000010101two's complement
One's complement00000000000000001101000111101010at 32 bits, every bit flipped
Bits reversed10101000011101001111111111111111at 32 bits
Rotated left by 111111111111111100101110000101011at 32 bits, wrapping
Shifted left by 1-11010001111010110= -107,478, no wrap
Shifted right by 1-110100011110110= -26,869, discarding the low bit
These bits as a double2.65505937 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-53,739 to the power 22,887,880,121
-53,739 to the power 3-155,191,789,822,419
-53,739 to the power 48,339,851,593,266,974,641
-53,739 to the power 5-448,175,284,770,573,950,232,699
First ten multiples-53,739, -107,478, -161,217, -214,956, -268,695, -322,434, -376,173, -429,912, -483,651, -537,390
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 39
As a percentage & fraction
As a percentage-5,373,900%
-53,739% as a decimal-537.39
-53,739% of 100-53,739
-53,739% of 1,000-537,390
As a fraction of 100-53,739/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -53,739
Nerdulate something else
Nothing in mind? Surprise me · today’s page