Recognised as Number
-23,665
- Negative
- Odd
- 5 digits
-23,665 is an odd 5-digit integer and the negative of 23,665. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value23,665
Digit count5
Digit sum22
Digit product1,080
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 × 4,733
Distinct prime factors25, 4,733
Number of divisors4
Sum of divisors σ(n)28,404
SquarefreeYesno repeated prime factor
All divisors1, 5, 4,733, 23,6654 in total
Arithmetic
Representations
Decimal-23,665
Binary10111000111000115 bits
Octal56161
Hexadecimal5C71
Base 36I9D
In wordsminus twenty-three thousand, six hundred and sixty-five
Ordinalminus twenty-three thousand, six hundred and sixty-fifth
Scientific notation-2.3665 × 10^4
Engineering notation-23.665 × 10^3
In other bases
Ternary1012110111base 3; the most digit-efficient integer base after e: 10 digits
Quinary1224130base 5; one hand: 7 digits
Septenary125665base 7: 6 digits
Nonary35414base 9; each digit is two ternary digits: 5 digits
Duodecimal11841base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2j35base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:34:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT11TT0TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110010010010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010001110001111
Bit length15 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits7within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes25c 71
Gray code111001001001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010001110001111two's complement
32-bit11111111111111111010001110001111two's complement
64-bit1111111111111111111111111111111111111111111111111010001110001111two's complement
One's complement0101110001110000at 16 bits, every bit flipped
Bits reversed1111000111000101at 16 bits
Rotated left by 10100011100011111at 16 bits, wrapping
Shifted left by 1-1011100011100010= -47,330, no wrap
Shifted right by 1-10111000111001= -11,832, discarding the low bit
These bits as a double1.16920635 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-23,665 to the power 2560,032,225
-23,665 to the power 3-13,253,162,604,625
-23,665 to the power 4313,636,093,038,450,625
-23,665 to the power 5-7,422,198,141,754,934,040,625
First ten multiples-23,665, -47,330, -70,995, -94,660, -118,325, -141,990, -165,655, -189,320, -212,985, -236,650
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
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 5
Divisible by 8No, remainder 1
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-2,366,500%
-23,665% as a decimal-236.65
-23,665% of 100-23,665
-23,665% of 1,000-236,650
As a fraction of 100-23,665/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -23,665
Nerdulate something else
Nothing in mind? Surprise me · today’s page