Recognised as Number
-4,391
- Negative
- Odd
- 4 digits
-4,391 is an odd 4-digit integer and the negative of 4,391. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value4,391
Digit count4
Digit sum17
Digit product108
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 4,391
Distinct prime factors14,391
Number of divisors2
Sum of divisors σ(n)4,392
SquarefreeYesno repeated prime factor
All divisors1, 4,3912 in total
Arithmetic
Previous number-4,392
Next number-4,390
Double-8,782
Half-2,195.5
Square19,280,881
Cube-84,662,348,471
Cube root-16.375245223≈
Negation4,391
Reciprocal-0.0002277386≈
Representations
Decimal-4,391
Binary100010010011113 bits
Octal10447
Hexadecimal1127
Base 363DZ
In wordsminus four thousand, three hundred and ninety-one
Ordinalminus four thousand, three hundred and ninety-first
Scientific notation-4.391 × 10^3
Engineering notation-4.391 × 10^3
In other bases
Ternary20000122base 3; the most digit-efficient integer base after e: 8 digits
Quinary120031base 5; one hand: 6 digits
Septenary15542base 7: 5 digits
Nonary6018base 9; each digit is two ternary digits: 4 digits
Duodecimal265bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalajbbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:13:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1000T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110111011011001
Bit length13 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits7within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes211 27
Gray code1100110110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110111011011001two's complement
32-bit11111111111111111110111011011001two's complement
64-bit1111111111111111111111111111111111111111111111111110111011011001two's complement
One's complement0001000100100110at 16 bits, every bit flipped
Bits reversed1001101101110111at 16 bits
Rotated left by 11101110110110011at 16 bits, wrapping
Shifted left by 1-10001001001110= -8,782, no wrap
Shifted right by 1-100010010100= -2,195, discarding the low bit
These bits as a double2.16944225 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-4,391 to the power 219,280,881
-4,391 to the power 3-84,662,348,471
-4,391 to the power 4371,752,372,136,161
-4,391 to the power 5-1,632,364,666,049,882,951
First ten multiples-4,391, -8,782, -13,173, -17,564, -21,955, -26,346, -30,737, -35,128, -39,519, -43,910
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
As a percentage & fraction
As a percentage-439,100%
-4,391% as a decimal-43.91
-4,391% of 100-4,391
-4,391% of 1,000-43,910
As a fraction of 100-4,391/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -4,391
Nerdulate something else
Nothing in mind? Surprise me · today’s page