Recognised as Number
-12,261
- Negative
- Odd
- 5 digits
-12,261 is an odd 5-digit integer and the negative of 12,261. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value12,261
Digit count5
Digit sum12
Digit product24
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 61 × 67
Distinct prime factors33, 61, 67
Number of divisors8
Sum of divisors σ(n)16,864
SquarefreeYesno repeated prime factor
All divisors1, 3, 61, 67, 183, 201, 4,087, 12,2618 in total
Arithmetic
Representations
Decimal-12,261
Binary1011111110010114 bits
Octal27745
Hexadecimal2FE5
Base 369GL
In wordsminus twelve thousand, two hundred and sixty-one
Ordinalminus twelve thousand, two hundred and sixty-first
Scientific notation-1.2261 × 10^4
Engineering notation-12.261 × 10^3
In other bases
Ternary121211010base 3; the most digit-efficient integer base after e: 9 digits
Quinary343021base 5; one hand: 6 digits
Septenary50514base 7: 5 digits
Nonary17733base 9; each digit is two ternary digits: 5 digits
Duodecimal7119base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1ad1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:24:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1011TT0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000001101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101000000011011
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 e5
Gray code11100000010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101000000011011two's complement
32-bit11111111111111111101000000011011two's complement
64-bit1111111111111111111111111111111111111111111111111101000000011011two's complement
One's complement0010111111100100at 16 bits, every bit flipped
Bits reversed1101100000001011at 16 bits
Rotated left by 11010000000110111at 16 bits, wrapping
Shifted left by 1-101111111001010= -24,522, no wrap
Shifted right by 1-1011111110011= -6,130, discarding the low bit
These bits as a double6.05773888 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-12,261 to the power 2150,332,121
-12,261 to the power 3-1,843,222,135,581
-12,261 to the power 422,599,746,604,358,641
-12,261 to the power 5-277,095,493,116,041,297,301
First ten multiples-12,261, -24,522, -36,783, -49,044, -61,305, -73,566, -85,827, -98,088, -110,349, -122,610
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 61
As a percentage & fraction
As a percentage-1,226,100%
-12,261% as a decimal-122.61
-12,261% of 100-12,261
-12,261% of 1,000-122,610
As a fraction of 100-12,261/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -12,261
Nerdulate something else
Nothing in mind? Surprise me · today’s page