Recognised as Number
-50,271
- Negative
- Odd
- 5 digits
-50,271 is an odd 5-digit integer and the negative of 50,271. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value50,271
Digit count5
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 13 × 1,289
Distinct prime factors33, 13, 1,289
Number of divisors8
Sum of divisors σ(n)72,240
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 39, 1,289, 3,867, 16,757, 50,2718 in total
Arithmetic
Representations
Decimal-50,271
Binary110001000101111116 bits
Octal142137
HexadecimalC45F
Base 3612SF
In wordsminus fifty thousand, two hundred and seventy-one
Ordinalminus fifty thousand, two hundred and seventy-first
Scientific notation-5.0271 × 10^4
Engineering notation-50.271 × 10^3
In other bases
Ternary2112221220base 3; the most digit-efficient integer base after e: 10 digits
Quinary3102041base 5; one hand: 7 digits
Septenary266364base 7: 6 digits
Nonary75856base 9; each digit is two ternary digits: 5 digits
Duodecimal25113base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal65dbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:57:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0110001010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110100110011100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110011101110100001
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2c4 5f
Gray code1010011001110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110011101110100001two's complement
64-bit1111111111111111111111111111111111111111111111110011101110100001two's complement
One's complement00000000000000001100010001011110at 32 bits, every bit flipped
Bits reversed10000101110111001111111111111111at 32 bits
Rotated left by 111111111111111100111011101000011at 32 bits, wrapping
Shifted left by 1-11000100010111110= -100,542, no wrap
Shifted right by 1-110001000110000= -25,135, discarding the low bit
These bits as a double2.48371741 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-50,271 to the power 22,527,173,441
-50,271 to the power 3-127,043,536,052,511
-50,271 to the power 46,386,605,600,895,780,481
-50,271 to the power 5-321,061,050,162,631,780,560,351
First ten multiples-50,271, -100,542, -150,813, -201,084, -251,355, -301,626, -351,897, -402,168, -452,439, -502,710
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-5,027,100%
-50,271% as a decimal-502.71
-50,271% of 100-50,271
-50,271% of 1,000-502,710
As a fraction of 100-50,271/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -50,271
Nerdulate something else
Nothing in mind? Surprise me · today’s page