Recognised as Number

50,367

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value50,367

Digit count5

Digit sum21

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 103 × 163

Distinct prime factors33, 103, 163

Number of divisors8

Sum of divisors σ(n)68,224

Aliquot sum17,857sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,754the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 33,048

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 103, 163, 309, 489, 16,789, 50,3678 in total

Arithmetic

Previous number50,366

Next number50,368

Double100,734

Half25,183.5

Square2,536,834,689

Cube127,772,752,780,863

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

Cube root36.930231319≈

Negation-50,367

Reciprocal0.0000198543≈

Representations

Decimal50,367

Binary110001001011111116 bits

Octal142277

HexadecimalC4BF

Base 3612V3

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

In wordsfifty thousand, three hundred and sixty-seven

Ordinalfifty thousand, three hundred and sixty-seventh

Scientific notation5.0367 × 10^4

Engineering notation50.367 × 10^3

In other bases

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

Quinary3102432base 5; one hand: 7 digits

Septenary266562base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100010010111111

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

Bytes2c4 bf

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

At each machine width

16-bit1100010010111111

32-bit00000000000000001100010010111111

64-bit0000000000000000000000000000000000000000000000001100010010111111

One's complement0011101101000000at 16 bits, every bit flipped

Bits reversed1111110100100011at 16 bits

Rotated left by 11000100101111111at 16 bits, wrapping

Shifted left by 111000100101111110= 100,734, no wrap

Shifted right by 1110001001011111= 25,183, discarding the low bit

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

Nearest landmarks

Next prime50,377+10

Previous prime50,363−4

Distance to nearest prime4

Nearest square below50,176

Nearest square above50,625

Powers & multiples

50,367 to the power 22,536,834,689

50,367 to the power 3127,772,752,780,863

50,367 to the power 46,435,530,239,313,726,721

50,367 to the power 5324,138,351,563,514,473,756,607

First ten multiples50,367, 100,734, 151,101, 201,468, 251,835, 302,202, 352,569, 402,936, 453,303, 503,670

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 9

Divisible by 12No, remainder 3

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time

Highest value reached1,147,44422× the starting value

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

First steps50,367 → 151,102 → 75,551 → 226,654 → 113,327 → 339,982 → 169,991 → 509,974 → 254,987 → 764,962 → …

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

As a percentage & fraction

As a percentage5,036,700%

50,367% as a decimal503.67

50,367% of 10050,367

50,367% of 1,000503,670

As a fraction of 10050,367/100

Read another way

As seconds13 hours, 59 minutes and 27 seconds

As bytes49.187 KiB

As a 24-bit colour#00C4BF

Keep nerding

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