Recognised as Number
-12,769
- Negative
- Odd
- Perfect square
- 5 digits
-12,769 is an odd 5-digit integer and the negative of 12,769. It has 3 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value12,769
Digit count5
Digit sum25
Digit product756
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 113²
Factors & divisors
Prime factorisation−1 × 113^2
Distinct prime factors1113
Number of divisors3
Sum of divisors σ(n)12,883
SquarefreeNohas a repeated prime factor
All divisors1, 113, 12,7693 in total
Arithmetic
Representations
Decimal-12,769
Binary1100011110000114 bits
Octal30741
Hexadecimal31E1
Base 369UP
In wordsminus twelve thousand, seven hundred and sixty-nine
Ordinalminus twelve thousand, seven hundred and sixty-ninth
Scientific notation-1.2769 × 10^4
Engineering notation-12.769 × 10^3
In other bases
Ternary122111221base 3; the most digit-efficient integer base after e: 9 digits
Quinary402034base 5; one hand: 6 digits
Septenary52141base 7: 5 digits
Nonary18457base 9; each digit is two ternary digits: 5 digits
Duodecimal7481base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1bi9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:32:49base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10011101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101001001100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100111000011111
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 odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes231 e1
Gray code10100100010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100111000011111two's complement
32-bit11111111111111111100111000011111two's complement
64-bit1111111111111111111111111111111111111111111111111100111000011111two's complement
One's complement0011000111100000at 16 bits, every bit flipped
Bits reversed1111100001110011at 16 bits
Rotated left by 11001110000111111at 16 bits, wrapping
Shifted left by 1-110001111000010= -25,538, no wrap
Shifted right by 1-1100011110001= -6,384, discarding the low bit
These bits as a double6.30872423 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-12,769 to the power 2163,047,361
-12,769 to the power 3-2,081,951,752,609
-12,769 to the power 426,584,441,929,064,321
-12,769 to the power 5-339,456,738,992,222,314,849
First ten multiples-12,769, -25,538, -38,307, -51,076, -63,845, -76,614, -89,383, -102,152, -114,921, -127,690
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 69
As a percentage & fraction
As a percentage-1,276,900%
-12,769% as a decimal-127.69
-12,769% of 100-12,769
-12,769% of 1,000-127,690
As a fraction of 100-12,769/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -12,769
Nerdulate something else
Nothing in mind? Surprise me · today’s page