Recognised as Number
-11,413
- Negative
- Odd
- 5 digits
-11,413 is an odd 5-digit integer and the negative of 11,413. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value11,413
Digit count5
Digit sum10
Digit product12
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 101 × 113
Distinct prime factors2101, 113
Number of divisors4
Sum of divisors σ(n)11,628
SquarefreeYesno repeated prime factor
All divisors1, 101, 113, 11,4134 in total
Arithmetic
Representations
Decimal-11,413
Binary1011001001010114 bits
Octal26225
Hexadecimal2C95
Base 368T1
In wordsminus eleven thousand, four hundred and thirteen
Ordinalminus eleven thousand, four hundred and thirteenth
Scientific notation-1.1413 × 10^4
Engineering notation-11.413 × 10^3
In other bases
Ternary120122201base 3; the most digit-efficient integer base after e: 9 digits
Quinary331123base 5; one hand: 6 digits
Septenary45163base 7: 5 digits
Nonary16581base 9; each digit is two ternary digits: 5 digits
Duodecimal6731base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal18adbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:10:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11T10010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010010111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101001101101011
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
Bytes22c 95
Gray code11101011011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101001101101011two's complement
32-bit11111111111111111101001101101011two's complement
64-bit1111111111111111111111111111111111111111111111111101001101101011two's complement
One's complement0010110010010100at 16 bits, every bit flipped
Bits reversed1101011011001011at 16 bits
Rotated left by 11010011011010111at 16 bits, wrapping
Shifted left by 1-101100100101010= -22,826, no wrap
Shifted right by 1-1011001001011= -5,706, discarding the low bit
These bits as a double5.63877122 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-11,413 to the power 2130,256,569
-11,413 to the power 3-1,486,618,221,997
-11,413 to the power 416,966,773,767,651,761
-11,413 to the power 5-193,641,789,010,209,548,293
First ten multiples-11,413, -22,826, -34,239, -45,652, -57,065, -68,478, -79,891, -91,304, -102,717, -114,130
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-1,141,300%
-11,413% as a decimal-114.13
-11,413% of 100-11,413
-11,413% of 1,000-114,130
As a fraction of 100-11,413/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -11,413
Nerdulate something else
Nothing in mind? Surprise me · today’s page