Nerdulator> put something in

Recognised as Number

-421

  • Negative
  • Odd
  • 3 digits

-421 is an odd 3-digit integer and the negative of 421. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value421
Digit count3
Digit sum7
Digit product8
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 × 421
Distinct prime factors1421
Number of divisors2
Sum of divisors σ(n)422
SquarefreeYesno repeated prime factor
All divisors1, 4212 in total

Arithmetic

Previous number-422
Next number-420
Double-842
Half-210.5
Square177,241
Cube root-7.494811226
Negation421
Reciprocal-0.0023752969

Representations

Decimal-421
Binary1101001019 bits
Octal645
Hexadecimal1A5
Base 36BP
In wordsminus four hundred and twenty-one
Ordinalminus four hundred and twenty-first
Scientific notation-4.21 × 10^2
Engineering notation-421

In other bases

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

Bit-level

1111111001011011
Bit length9 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits4within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 8worth 256
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes201 a5
Gray code101110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111111001011011two's complement
32-bit11111111111111111111111001011011two's complement
64-bit1111111111111111111111111111111111111111111111111111111001011011two's complement
One's complement0000000110100100at 16 bits, every bit flipped
Bits reversed1101101001111111at 16 bits
Rotated left by 11111110010110111at 16 bits, wrapping
Shifted left by 1-1101001010= -842, no wrap
Shifted right by 1-11010011= -210, discarding the low bit
These bits as a double2.08001637 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+423
Nearest square below400
Nearest square above441

Powers & multiples

-421 to the power 2177,241
-421 to the power 3-74,618,461
-421 to the power 431,414,372,081
-421 to the power 5-13,225,450,646,101
First ten multiples-421, -842, -1,263, -1,684, -2,105, -2,526, -2,947, -3,368, -3,789, -4,210
Powers of twoBetween 2^8 (256) and 2^9 (512)

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 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21

As a percentage & fraction

As a percentage-42,100%
-421% as a decimal-4.21
-421% of 100-421
-421% of 1,000-4,210
As a fraction of 100-421/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 “-421” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.