Recognised as Number
-31,261
- Negative
- Odd
- 5 digits
-31,261 is an odd 5-digit integer and the negative of 31,261. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,261
Digit count5
Digit sum13
Digit product36
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 × 43 × 727
Distinct prime factors243, 727
Number of divisors4
Sum of divisors σ(n)32,032
SquarefreeYesno repeated prime factor
All divisors1, 43, 727, 31,2614 in total
Arithmetic
Representations
Decimal-31,261
Binary11110100001110115 bits
Octal75035
Hexadecimal7A1D
Base 36O4D
In wordsminus thirty-one thousand, two hundred and sixty-one
Ordinalminus thirty-one thousand, two hundred and sixty-first
Scientific notation-3.1261 × 10^4
Engineering notation-31.261 × 10^3
In other bases
Ternary1120212211base 3; the most digit-efficient integer base after e: 10 digits
Quinary2000021base 5; one hand: 7 digits
Septenary160066base 7: 6 digits
Nonary46784base 9; each digit is two ternary digits: 5 digits
Duodecimal16111base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3i31base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:41:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111T0101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001101000100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000010111100011
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 1d
Gray code100011100010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000010111100011two's complement
32-bit11111111111111111000010111100011two's complement
64-bit1111111111111111111111111111111111111111111111111000010111100011two's complement
One's complement0111101000011100at 16 bits, every bit flipped
Bits reversed1100011110100001at 16 bits
Rotated left by 10000101111000111at 16 bits, wrapping
Shifted left by 1-1111010000111010= -62,522, no wrap
Shifted right by 1-11110100001111= -15,630, discarding the low bit
These bits as a double1.54449862 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,261 to the power 2977,250,121
-31,261 to the power 3-30,549,816,032,581
-31,261 to the power 4955,017,798,994,514,641
-31,261 to the power 5-29,854,811,414,367,522,192,301
First ten multiples-31,261, -62,522, -93,783, -125,044, -156,305, -187,566, -218,827, -250,088, -281,349, -312,610
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 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
As a percentage & fraction
As a percentage-3,126,100%
-31,261% as a decimal-312.61
-31,261% of 100-31,261
-31,261% of 1,000-312,610
As a fraction of 100-31,261/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,261
Nerdulate something else
Nothing in mind? Surprise me · today’s page