Recognised as Number

50,377

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value50,377

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation50,377

Distinct prime factors150,377

Number of divisors2

Sum of divisors σ(n)50,378

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)50,376integers below n that share no factor with it

Carmichael function λ(n)50,376the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 50,3772 in total

Arithmetic

Previous number50,376

Next number50,378

Double100,754

Half25,188.5

Square2,537,842,129

Cube127,848,872,932,633

Square root224.44821229≈irrational, shown to 9 decimal places

Cube root36.932675233≈

Negation-50,377

Reciprocal0.0000198503≈

Representations

Decimal50,377

Binary110001001100100116 bits

Octal142311

HexadecimalC4C9

Base 3612VD

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsfifty thousand, three hundred and seventy-seven

Ordinalfifty thousand, three hundred and seventy-seventh

Scientific notation5.0377 × 10^4

Engineering notation50.377 × 10^3

In other bases

Ternary2120002211base 3; the most digit-efficient integer base after e: 10 digits

Quinary3103002base 5; one hand: 7 digits

Septenary266605base 7: 6 digits

Nonary76084base 9; each digit is two ternary digits: 5 digits

Duodecimal251a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal65ihbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal13:59:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary10TT0010T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11100010111011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1100010011001001

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2c4 c9

Gray code1010011010101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100010011001001

32-bit00000000000000001100010011001001

64-bit0000000000000000000000000000000000000000000000001100010011001001

One's complement0011101100110110at 16 bits, every bit flipped

Bits reversed1001001100100011at 16 bits

Rotated left by 11000100110010011at 16 bits, wrapping

Shifted left by 111000100110010010= 100,754, no wrap

Shifted right by 1110001001100100= 25,188, discarding the low bit

These bits as a double2.4889545 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime50,383+6

Previous prime50,363−14

Distance to nearest prime0, it is prime

Nearest square below50,176

Nearest square above50,625

Powers & multiples

50,377 to the power 22,537,842,129

50,377 to the power 3127,848,872,932,633

50,377 to the power 46,440,642,671,727,252,641

50,377 to the power 5324,460,255,873,603,806,295,657

First ten multiples50,377, 100,754, 151,131, 201,508, 251,885, 302,262, 352,639, 403,016, 453,393, 503,770

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 8

Divisible by 12No, remainder 1

Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time

Highest value reached255,0405× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps50,377 → 151,132 → 75,566 → 37,783 → 113,350 → 56,675 → 170,026 → 85,013 → 255,040 → 127,520 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,037,700%

50,377% as a decimal503.77

50,377% of 10050,377

50,377% of 1,000503,770

As a fraction of 10050,377/100

Read another way

As seconds13 hours, 59 minutes and 37 seconds

As bytes49.196 KiB

As a 24-bit colour#00C4C9

Keep nerding

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