Nerdulator> put something in

Recognised as Number

-8,401

  • Negative
  • Odd
  • 4 digits

-8,401 is an odd 4-digit integer and the negative of 8,401. It has 4 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value8,401
Digit count4
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 31 × 271
Distinct prime factors231, 271
Number of divisors4
Sum of divisors σ(n)8,704
SquarefreeYesno repeated prime factor
All divisors1, 31, 271, 8,4014 in total

Arithmetic

Previous number-8,402
Next number-8,400
Double-16,802
Cube root-20.328733768
Negation8,401
Reciprocal-0.0001190334

Representations

Decimal-8,401
Binary1000001101000114 bits
Octal20321
Hexadecimal20D1
Base 366HD
In wordsminus eight thousand, four hundred and one
Ordinalminus eight thousand, four hundred and first
Scientific notation-8.401 × 10^3
Engineering notation-8.401 × 10^3

In other bases

Ternary102112011base 3; the most digit-efficient integer base after e: 9 digits
Quinary232101base 5; one hand: 6 digits
Septenary33331base 7: 5 digits
Nonary12464base 9; each digit is two ternary digits: 5 digits
Duodecimal4a41base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1101base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:20:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT01110TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001101110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101111100101111
Bit length14 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits9within that length
Bit parityodd5 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
Bytes220 d1
Gray code11000010111001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101111100101111two's complement
32-bit11111111111111111101111100101111two's complement
64-bit1111111111111111111111111111111111111111111111111101111100101111two's complement
One's complement0010000011010000at 16 bits, every bit flipped
Bits reversed1111010011111011at 16 bits
Rotated left by 11011111001011111at 16 bits, wrapping
Shifted left by 1-100000110100010= -16,802, no wrap
Shifted right by 1-1000001101001= -4,200, discarding the low bit
These bits as a double4.15064549 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+8,403
Nearest square below8,281
Nearest square above8,464

Powers & multiples

-8,401 to the power 270,576,801
-8,401 to the power 3-592,915,705,201
-8,401 to the power 44,981,084,839,393,601
-8,401 to the power 5-41,846,093,735,745,642,001
First ten multiples-8,401, -16,802, -25,203, -33,604, -42,005, -50,406, -58,807, -67,208, -75,609, -84,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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1

As a percentage & fraction

As a percentage-840,100%
-8,401% as a decimal-84.01
-8,401% of 100-8,401
-8,401% of 1,000-84,010
As a fraction of 100-8,401/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “-8401” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.