Recognised as Number
-65,997
- Negative
- Odd
- 5 digits
-65,997 is an odd 5-digit integer and the negative of 65,997. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value65,997
Digit count5
Digit sum36
Digit product17,010
Multiplicative persistence2times 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,333
Distinct prime factors23, 7,333
Number of divisors6
Sum of divisors σ(n)95,342
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 7,333, 21,999, 65,9976 in total
Arithmetic
Representations
Decimal-65,997
Binary1000000011100110117 bits
Octal200715
Hexadecimal101CD
Base 361EX9
In wordsminus sixty-five thousand, nine hundred and ninety-seven
Ordinalminus sixty-five thousand, nine hundred and ninety-seventh
Scientific notation-6.5997 × 10^4
Engineering notation-65.997 × 10^3
In other bases
Ternary10100112100base 3; the most digit-efficient integer base after e: 11 digits
Quinary4102442base 5; one hand: 7 digits
Septenary363261base 7: 6 digits
Nonary110470base 9; each digit is two ternary digits: 6 digits
Duodecimal32239base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal84jhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:19:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T0T111T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110000001001110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111101111111000110011
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 01 cd
Gray code11000000100101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111101111111000110011two's complement
64-bit1111111111111111111111111111111111111111111111101111111000110011two's complement
One's complement00000000000000010000000111001100at 32 bits, every bit flipped
Bits reversed11001100011111110111111111111111at 32 bits
Rotated left by 111111111111111011111110001100111at 32 bits, wrapping
Shifted left by 1-100000001110011010= -131,994, no wrap
Shifted right by 1-1000000011100111= -32,998, discarding the low bit
These bits as a double3.26068504 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-65,997 to the power 24,355,604,009
-65,997 to the power 3-287,456,797,781,973
-65,997 to the power 418,971,286,283,216,872,081
-65,997 to the power 5-1,252,047,980,833,463,906,729,757
First ten multiples-65,997, -131,994, -197,991, -263,988, -329,985, -395,982, -461,979, -527,976, -593,973, -659,970
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 97
As a percentage & fraction
As a percentage-6,599,700%
-65,997% as a decimal-659.97
-65,997% of 100-65,997
-65,997% of 1,000-659,970
As a fraction of 100-65,997/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -65,997
Nerdulate something else
Nothing in mind? Surprise me · today’s page