Recognised as Number
-31,405
- Negative
- Odd
- 5 digits
-31,405 is an odd 5-digit integer and the negative of 31,405. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,405
Digit count5
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 × 5 × 11 × 571
Distinct prime factors35, 11, 571
Number of divisors8
Sum of divisors σ(n)41,184
SquarefreeYesno repeated prime factor
All divisors1, 5, 11, 55, 571, 2,855, 6,281, 31,4058 in total
Arithmetic
Representations
Decimal-31,405
Binary11110101010110115 bits
Octal75255
Hexadecimal7AAD
Base 36O8D
In wordsminus thirty-one thousand, four hundred and five
Ordinalminus thirty-one thousand, four hundred and fifth
Scientific notation-3.1405 × 10^4
Engineering notation-31.405 × 10^3
In other bases
Ternary1121002011base 3; the most digit-efficient integer base after e: 10 digits
Quinary2001110base 5; one hand: 7 digits
Septenary160363base 7: 6 digits
Nonary47064base 9; each digit is two ternary digits: 5 digits
Duodecimal16211base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3ia5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:43:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111T0T10TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000010101010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000010101010011
Bit length15 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits5within that length
Bit parityeven10 set bits, so even; 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 ad
Gray code100011111111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000010101010011two's complement
32-bit11111111111111111000010101010011two's complement
64-bit1111111111111111111111111111111111111111111111111000010101010011two's complement
One's complement0111101010101100at 16 bits, every bit flipped
Bits reversed1100101010100001at 16 bits
Rotated left by 10000101010100111at 16 bits, wrapping
Shifted left by 1-1111010101011010= -62,810, no wrap
Shifted right by 1-11110101010111= -15,702, discarding the low bit
These bits as a double1.55161316 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,405 to the power 2986,274,025
-31,405 to the power 3-30,973,935,755,125
-31,405 to the power 4972,736,452,389,700,625
-31,405 to the power 5-30,548,788,287,298,548,128,125
First ten multiples-31,405, -62,810, -94,215, -125,620, -157,025, -188,430, -219,835, -251,240, -282,645, -314,050
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 5
As a percentage & fraction
As a percentage-3,140,500%
-31,405% as a decimal-314.05
-31,405% of 100-31,405
-31,405% of 1,000-314,050
As a fraction of 100-31,405/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,405
Nerdulate something else
Nothing in mind? Surprise me · today’s page