Recognised as Number
-4,367
- Negative
- Odd
- 4 digits
-4,367 is an odd 4-digit integer and the negative of 4,367. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value4,367
Digit count4
Digit sum20
Digit product504
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 11 × 397
Distinct prime factors211, 397
Number of divisors4
Sum of divisors σ(n)4,776
SquarefreeYesno repeated prime factor
All divisors1, 11, 397, 4,3674 in total
Arithmetic
Previous number-4,368
Next number-4,366
Double-8,734
Half-2,183.5
Square19,070,689
Cube-83,281,698,863
Cube root-16.345356504≈
Negation4,367
Reciprocal-0.0002289902≈
Representations
Decimal-4,367
Binary100010000111113 bits
Octal10417
Hexadecimal110F
Base 363DB
In wordsminus four thousand, three hundred and sixty-seven
Ordinalminus four thousand, three hundred and sixty-seventh
Scientific notation-4.367 × 10^3
Engineering notation-4.367 × 10^3
In other bases
Ternary12222202base 3; the most digit-efficient integer base after e: 8 digits
Quinary114432base 5; one hand: 6 digits
Septenary15506base 7: 5 digits
Nonary5882base 9; each digit is two ternary digits: 4 digits
Duodecimal263bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalai7base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:12:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT100001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110111011110001
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 0f
Gray code1100110001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110111011110001two's complement
32-bit11111111111111111110111011110001two's complement
64-bit1111111111111111111111111111111111111111111111111110111011110001two's complement
One's complement0001000100001110at 16 bits, every bit flipped
Bits reversed1000111101110111at 16 bits
Rotated left by 11101110111100011at 16 bits, wrapping
Shifted left by 1-10001000011110= -8,734, no wrap
Shifted right by 1-100010001000= -2,183, discarding the low bit
These bits as a double2.15758468 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-4,367 to the power 219,070,689
-4,367 to the power 3-83,281,698,863
-4,367 to the power 4363,691,178,934,721
-4,367 to the power 5-1,588,239,378,407,926,607
First ten multiples-4,367, -8,734, -13,101, -17,468, -21,835, -26,202, -30,569, -34,936, -39,303, -43,670
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-436,700%
-4,367% as a decimal-43.67
-4,367% of 100-4,367
-4,367% of 1,000-43,670
As a fraction of 100-4,367/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -4,367
Nerdulate something else
Nothing in mind? Surprise me · today’s page