Nerdulator> put something in

Recognised as Number

50,837

  • Positive
  • Odd
  • Composite
  • 5 digits

50,837 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value50,837
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 factorisation29 × 1,753
Distinct prime factors229, 1,753
Number of divisors4
Sum of divisors σ(n)52,620
Aliquot sum1,783sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)49,056integers below n that share no factor with it
Carmichael function λ(n)12,264the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 49,056
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 29, 1,753, 50,8374 in total

Arithmetic

Previous number50,836
Next number50,838
Double101,674
Square root225.470618928≈irrational, shown to 9 decimal places
Cube root37.044747419≈
Negation-50,837
Reciprocal0.0000196707≈

Representations

Decimal50,837
Binary110001101001010116 bits
Octal143225
HexadecimalC695
Base 361385
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty thousand, eight hundred and thirty-seven
Ordinalfifty thousand, eight hundred and thirty-seventh
Scientific notation5.0837 × 10^4
Engineering notation50.837 × 10^3

In other bases

Ternary2120201212base 3; the most digit-efficient integer base after e: 10 digits
Quinary3111322base 5; one hand: 7 digits
Septenary301133base 7: 6 digits
Nonary76655base 9; each digit is two ternary digits: 5 digits
Duodecimal25505base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal671hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:7:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10TT1T1T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101101110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1100011010010101
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 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
Bytes2c6 95
Gray code1010010111011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100011010010101
32-bit00000000000000001100011010010101
64-bit0000000000000000000000000000000000000000000000001100011010010101
One's complement0011100101101010at 16 bits, every bit flipped
Bits reversed1010100101100011at 16 bits
Rotated left by 11000110100101011at 16 bits, wrapping
Shifted left by 111000110100101010= 101,674, no wrap
Shifted right by 1110001101001010= 25,418, discarding the low bit
These bits as a double2.51168152 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime50,839+2
Previous prime50,833−4
Distance to nearest prime2
Nearest square below50,625
Nearest square above51,076

Powers & multiples

50,837 to the power 22,584,400,569
50,837 to the power 3131,383,171,726,253
50,837 to the power 46,679,126,301,047,523,761
50,837 to the power 5339,546,743,766,352,965,437,957
First ten multiples50,837, 101,674, 152,511, 203,348, 254,185, 305,022, 355,859, 406,696, 457,533, 508,370
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 157the total stopping time
Highest value reached152,5123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps50,837 → 152,512 → 76,256 → 38,128 → 19,064 → 9,532 → 4,766 → 2,383 → 7,150 → 3,575 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,083,700%
50,837% as a decimal508.37
50,837% of 10050,837
50,837% of 1,000508,370
As a fraction of 10050,837/100

Read another way

As bytes49.646 KiB
As a 24-bit colour#00C695

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “50837” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.