Recognised as Number
-12,149
- Negative
- Odd
- 5 digits
-12,149 is an odd 5-digit integer and the negative of 12,149. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value12,149
Digit count5
Digit sum17
Digit product72
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 12,149
Distinct prime factors112,149
Number of divisors2
Sum of divisors σ(n)12,150
SquarefreeYesno repeated prime factor
All divisors1, 12,1492 in total
Arithmetic
Representations
Decimal-12,149
Binary1011110111010114 bits
Octal27565
Hexadecimal2F75
Base 369DH
In wordsminus twelve thousand, one hundred and forty-nine
Ordinalminus twelve thousand, one hundred and forty-ninth
Scientific notation-1.2149 × 10^4
Engineering notation-12.149 × 10^3
In other bases
Ternary121122222base 3; the most digit-efficient integer base after e: 9 digits
Quinary342044base 5; one hand: 6 digits
Septenary50264base 7: 5 digits
Nonary17588base 9; each digit is two ternary digits: 5 digits
Duodecimal7045base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1a79base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:22:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT101100001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000110011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101000010001011
Bit length14 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits4within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes22f 75
Gray code11100011001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101000010001011two's complement
32-bit11111111111111111101000010001011two's complement
64-bit1111111111111111111111111111111111111111111111111101000010001011two's complement
One's complement0010111101110100at 16 bits, every bit flipped
Bits reversed1101000100001011at 16 bits
Rotated left by 11010000100010111at 16 bits, wrapping
Shifted left by 1-101111011101010= -24,298, no wrap
Shifted right by 1-1011110111011= -6,074, discarding the low bit
These bits as a double6.00240353 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-12,149 to the power 2147,598,201
-12,149 to the power 3-1,793,170,543,949
-12,149 to the power 421,785,228,938,436,401
-12,149 to the power 5-264,668,746,373,063,835,749
First ten multiples-12,149, -24,298, -36,447, -48,596, -60,745, -72,894, -85,043, -97,192, -109,341, -121,490
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49
As a percentage & fraction
As a percentage-1,214,900%
-12,149% as a decimal-121.49
-12,149% of 100-12,149
-12,149% of 1,000-121,490
As a fraction of 100-12,149/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -12,149
Nerdulate something else
Nothing in mind? Surprise me · today’s page