Recognised as Number
50,864
- Positive
- Even
- Composite
- 5 digits
50,864 is an even 5-digit integer and a composite number. It has 30 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value50,864
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
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 11 × 17^2
Distinct prime factors32, 11, 17
Number of divisors30
Sum of divisors σ(n)114,204
Aliquot sum63,340sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)21,760integers below n that share no factor with it
Carmichael function λ(n)1,360the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,760
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 11, 16, 17, 22, 34, 44, 68, 88, 136, 176, 187, 272, 289, 374, 578, 748, 1,156, 1,496, 2,312, 2,992, 3,179, 4,624, 6,358, 12,716, 25,432, 50,86430 in total
Arithmetic
Representations
Decimal50,864
Binary110001101011000016 bits
Octal143260
HexadecimalC6B0
Base 36138W
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty thousand, eight hundred and sixty-four
Ordinalfifty thousand, eight hundred and sixty-fourth
Scientific notation5.0864 × 10^4
Engineering notation50.864 × 10^3
In other bases
Ternary2120202212base 3; the most digit-efficient integer base after e: 10 digits
Quinary3111424base 5; one hand: 7 digits
Septenary301202base 7: 6 digits
Nonary76685base 9; each digit is two ternary digits: 5 digits
Duodecimal25528base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6734base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:7:44base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10TT1T100TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101101111110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100011010110000
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes2c6 b0
Gray code1010010111101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100011010110000
32-bit00000000000000001100011010110000
64-bit0000000000000000000000000000000000000000000000001100011010110000
One's complement0011100101001111at 16 bits, every bit flipped
Bits reversed0000110101100011at 16 bits
Rotated left by 11000110101100001at 16 bits, wrapping
Shifted left by 111000110101100000= 101,728, no wrap
Shifted right by 1110001101011000= 25,432, discarding the low bit
These bits as a double2.5130155 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
50,864 to the power 22,587,146,496
50,864 to the power 3131,592,619,372,544
50,864 to the power 46,693,326,991,765,078,016
50,864 to the power 5340,449,384,109,138,928,205,824
First ten multiples50,864, 101,728, 152,592, 203,456, 254,320, 305,184, 356,048, 406,912, 457,776, 508,640
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 5
Divisible by 10No, remainder 4
Divisible by 11Yes
Divisible by 12No, remainder 8
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 183the total stopping time
Highest value reached50,864
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps50,864 → 25,432 → 12,716 → 6,358 → 3,179 → 9,538 → 4,769 → 14,308 → 7,154 → 3,577 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5,086,400%
50,864% as a decimal508.64
50,864% of 10050,864
50,864% of 1,000508,640
As a fraction of 10050,864/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 50,864
Nerdulate something else
Nothing in mind? Surprise me · today’s page