Recognised as Number
-50,495
- Negative
- Odd
- 5 digits
-50,495 is an odd 5-digit integer and the negative of 50,495. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value50,495
Digit count5
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 10,099
Distinct prime factors25, 10,099
Number of divisors4
Sum of divisors σ(n)60,600
SquarefreeYesno repeated prime factor
All divisors1, 5, 10,099, 50,4954 in total
Arithmetic
Representations
Decimal-50,495
Binary110001010011111116 bits
Octal142477
HexadecimalC53F
Base 3612YN
In wordsminus fifty thousand, four hundred and ninety-five
Ordinalminus fifty thousand, four hundred and ninety-fifth
Scientific notation-5.0495 × 10^4
Engineering notation-50.495 × 10^3
In other bases
Ternary2120021012base 3; the most digit-efficient integer base after e: 10 digits
Quinary3103440base 5; one hand: 7 digits
Septenary300134base 7: 6 digits
Nonary76235base 9; each digit is two ternary digits: 5 digits
Duodecimal2527bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal664fbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:1:35base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0110T1TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110100111111000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110011101011000001
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2c5 3f
Gray code1010011110100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110011101011000001two's complement
64-bit1111111111111111111111111111111111111111111111110011101011000001two's complement
One's complement00000000000000001100010100111110at 32 bits, every bit flipped
Bits reversed10000011010111001111111111111111at 32 bits
Rotated left by 111111111111111100111010110000011at 32 bits, wrapping
Shifted left by 1-11000101001111110= -100,990, no wrap
Shifted right by 1-110001010100000= -25,247, discarding the low bit
These bits as a double2.49478448 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-50,495 to the power 22,549,745,025
-50,495 to the power 3-128,749,375,037,375
-50,495 to the power 46,501,199,692,512,250,625
-50,495 to the power 5-328,278,078,473,406,095,309,375
First ten multiples-50,495, -100,990, -151,485, -201,980, -252,475, -302,970, -353,465, -403,960, -454,455, -504,950
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 95
As a percentage & fraction
As a percentage-5,049,500%
-50,495% as a decimal-504.95
-50,495% of 100-50,495
-50,495% of 1,000-504,950
As a fraction of 100-50,495/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -50,495
Nerdulate something else
Nothing in mind? Surprise me · today’s page