Recognised as Number
-12,664
- Negative
- Even
- 5 digits
-12,664 is an even 5-digit integer and the negative of 12,664. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value12,664
Digit count5
Digit sum19
Digit product288
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^3 × 1,583
Distinct prime factors22, 1,583
Number of divisors8
Sum of divisors σ(n)23,760
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 1,583, 3,166, 6,332, 12,6648 in total
Arithmetic
Representations
Decimal-12,664
Binary1100010111100014 bits
Octal30570
Hexadecimal3178
Base 369RS
In wordsminus twelve thousand, six hundred and sixty-four
Ordinalminus twelve thousand, six hundred and sixty-fourth
Scientific notation-1.2664 × 10^4
Engineering notation-12.664 × 10^3
In other bases
Ternary122101001base 3; the most digit-efficient integer base after e: 9 digits
Quinary401124base 5; one hand: 6 digits
Septenary51631base 7: 5 digits
Nonary18331base 9; each digit is two ternary digits: 5 digits
Duodecimal73b4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1bd4base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:31:4base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT101T0T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101001110011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100111010001000
Bit length14 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits7within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 13worth 8,192
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes231 78
Gray code10100111000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100111010001000two's complement
32-bit11111111111111111100111010001000two's complement
64-bit1111111111111111111111111111111111111111111111111100111010001000two's complement
One's complement0011000101110111at 16 bits, every bit flipped
Bits reversed0001000101110011at 16 bits
Rotated left by 11001110100010001at 16 bits, wrapping
Shifted left by 1-110001011110000= -25,328, no wrap
Shifted right by 1-1100010111100= -6,332, discarding the low bit
These bits as a double6.25684734 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-12,664 to the power 2160,376,896
-12,664 to the power 3-2,031,013,010,944
-12,664 to the power 425,720,748,770,594,816
-12,664 to the power 5-325,727,562,430,812,749,824
First ten multiples-12,664, -25,328, -37,992, -50,656, -63,320, -75,984, -88,648, -101,312, -113,976, -126,640
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
As a percentage & fraction
As a percentage-1,266,400%
-12,664% as a decimal-126.64
-12,664% of 100-12,664
-12,664% of 1,000-126,640
As a fraction of 100-12,664/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -12,664
Nerdulate something else
Nothing in mind? Surprise me · today’s page