Recognised as Number
50,779
- Positive
- Odd
- Composite
- 5 digits
50,779 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value50,779
Digit count5
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17 × 29 × 103
Distinct prime factors317, 29, 103
Number of divisors8
Sum of divisors σ(n)56,160
Aliquot sum5,381sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)45,696integers below n that share no factor with it
Carmichael function λ(n)5,712the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 45,696
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 29, 103, 493, 1,751, 2,987, 50,7798 in total
Arithmetic
Representations
Decimal50,779
Binary110001100101101116 bits
Octal143133
HexadecimalC65B
Base 36136J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty thousand, seven hundred and seventy-nine
Ordinalfifty thousand, seven hundred and seventy-ninth
Scientific notation5.0779 × 10^4
Engineering notation50.779 × 10^3
In other bases
Ternary2120122201base 3; the most digit-efficient integer base after e: 10 digits
Quinary3111104base 5; one hand: 7 digits
Septenary301021base 7: 6 digits
Nonary76581base 9; each digit is two ternary digits: 5 digits
Duodecimal25477base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal66ijbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:6:19base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10TT1T00T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101101110101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100011001011011
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
Bytes2c6 5b
Gray code1010010101110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100011001011011
32-bit00000000000000001100011001011011
64-bit0000000000000000000000000000000000000000000000001100011001011011
One's complement0011100110100100at 16 bits, every bit flipped
Bits reversed1101101001100011at 16 bits
Rotated left by 11000110010110111at 16 bits, wrapping
Shifted left by 111000110010110110= 101,558, no wrap
Shifted right by 1110001100101101= 25,389, discarding the low bit
These bits as a double2.50881594 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
50,779 to the power 22,578,506,841
50,779 to the power 3130,933,998,879,139
50,779 to the power 46,648,697,529,083,799,281
50,779 to the power 5337,614,211,829,346,243,689,899
First ten multiples50,779, 101,558, 152,337, 203,116, 253,895, 304,674, 355,453, 406,232, 457,011, 507,790
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1202the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps50,779 → 152,338 → 76,169 → 228,508 → 114,254 → 57,127 → 171,382 → 85,691 → 257,074 → 128,537 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5,077,900%
50,779% as a decimal507.79
50,779% of 10050,779
50,779% of 1,000507,790
As a fraction of 10050,779/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,779
Nerdulate something else
Nothing in mind? Surprise me · today’s page