Recognised as Number
-31,441
- Negative
- Odd
- 5 digits
-31,441 is an odd 5-digit integer and the negative of 31,441. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,441
Digit count5
Digit sum13
Digit product48
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 23 × 1,367
Distinct prime factors223, 1,367
Number of divisors4
Sum of divisors σ(n)32,832
SquarefreeYesno repeated prime factor
All divisors1, 23, 1,367, 31,4414 in total
Arithmetic
Representations
Decimal-31,441
Binary11110101101000115 bits
Octal75321
Hexadecimal7AD1
Base 36O9D
In wordsminus thirty-one thousand, four hundred and forty-one
Ordinalminus thirty-one thousand, four hundred and forty-first
Scientific notation-3.1441 × 10^4
Engineering notation-31.441 × 10^3
In other bases
Ternary1121010111base 3; the most digit-efficient integer base after e: 10 digits
Quinary2001231base 5; one hand: 7 digits
Septenary160444base 7: 6 digits
Nonary47114base 9; each digit is two ternary digits: 5 digits
Duodecimal16241base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3ic1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:44:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111T0T0TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000010101110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000010100101111
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes27a d1
Gray code100011110111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000010100101111two's complement
32-bit11111111111111111000010100101111two's complement
64-bit1111111111111111111111111111111111111111111111111000010100101111two's complement
One's complement0111101011010000at 16 bits, every bit flipped
Bits reversed1111010010100001at 16 bits
Rotated left by 10000101001011111at 16 bits, wrapping
Shifted left by 1-1111010110100010= -62,882, no wrap
Shifted right by 1-11110101101001= -15,720, discarding the low bit
These bits as a double1.5533918 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,441 to the power 2988,536,481
-31,441 to the power 3-31,080,575,499,121
-31,441 to the power 4977,204,374,267,863,361
-31,441 to the power 5-30,724,282,731,355,891,933,201
First ten multiples-31,441, -62,882, -94,323, -125,764, -157,205, -188,646, -220,087, -251,528, -282,969, -314,410
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41
As a percentage & fraction
As a percentage-3,144,100%
-31,441% as a decimal-314.41
-31,441% of 100-31,441
-31,441% of 1,000-314,410
As a fraction of 100-31,441/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,441
Nerdulate something else
Nothing in mind? Surprise me · today’s page