Recognised as Number
-11,401
- Negative
- Odd
- 5 digits
-11,401 is an odd 5-digit integer and the negative of 11,401. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value11,401
Digit count5
Digit sum7
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 13 × 877
Distinct prime factors213, 877
Number of divisors4
Sum of divisors σ(n)12,292
SquarefreeYesno repeated prime factor
All divisors1, 13, 877, 11,4014 in total
Arithmetic
Representations
Decimal-11,401
Binary1011001000100114 bits
Octal26211
Hexadecimal2C89
Base 368SP
In wordsminus eleven thousand, four hundred and one
Ordinalminus eleven thousand, four hundred and first
Scientific notation-1.1401 × 10^4
Engineering notation-11.401 × 10^3
In other bases
Ternary120122021base 3; the most digit-efficient integer base after e: 9 digits
Quinary331101base 5; one hand: 6 digits
Septenary45145base 7: 5 digits
Nonary16567base 9; each digit is two ternary digits: 5 digits
Duodecimal6721base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal18a1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:10:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11T101T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010010001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101001101110111
Bit length14 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits8within that length
Bit parityeven6 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
Bytes22c 89
Gray code11101011001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101001101110111two's complement
32-bit11111111111111111101001101110111two's complement
64-bit1111111111111111111111111111111111111111111111111101001101110111two's complement
One's complement0010110010001000at 16 bits, every bit flipped
Bits reversed1110111011001011at 16 bits
Rotated left by 11010011011101111at 16 bits, wrapping
Shifted left by 1-101100100010010= -22,802, no wrap
Shifted right by 1-1011001000101= -5,700, discarding the low bit
These bits as a double5.63284243 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-11,401 to the power 2129,982,801
-11,401 to the power 3-1,481,933,914,201
-11,401 to the power 416,895,528,555,805,601
-11,401 to the power 5-192,625,921,064,739,657,001
First ten multiples-11,401, -22,802, -34,203, -45,604, -57,005, -68,406, -79,807, -91,208, -102,609, -114,010
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-1,140,100%
-11,401% as a decimal-114.01
-11,401% of 100-11,401
-11,401% of 1,000-114,010
As a fraction of 100-11,401/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -11,401
Nerdulate something else
Nothing in mind? Surprise me · today’s page