Recognised as Number

50,365

Positive
Odd
Composite
5 digits

50,365 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,365

Digit count5

Digit sum19

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 factorisation5 × 7 × 1,439

Distinct prime factors35, 7, 1,439

Number of divisors8

Sum of divisors σ(n)69,120

Aliquot sum18,755sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)8,628the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 34,512

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 7, 35, 1,439, 7,195, 10,073, 50,3658 in total

Arithmetic

Previous number50,364

Next number50,366

Double100,730

Half25,182.5

Square2,536,633,225

Cube127,757,532,377,125

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

Cube root36.929742498≈

Negation-50,365

Reciprocal0.0000198551≈

Representations

Decimal50,365

Binary110001001011110116 bits

Octal142275

HexadecimalC4BD

Base 3612V1

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

In wordsfifty thousand, three hundred and sixty-five

Ordinalfifty thousand, three hundred and sixty-fifth

Scientific notation5.0365 × 10^4

Engineering notation50.365 × 10^3

In other bases

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

Quinary3102430base 5; one hand: 7 digits

Septenary266560base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100010010111101

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

Bytes2c4 bd

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

At each machine width

16-bit1100010010111101

32-bit00000000000000001100010010111101

64-bit0000000000000000000000000000000000000000000000001100010010111101

One's complement0011101101000010at 16 bits, every bit flipped

Bits reversed1011110100100011at 16 bits

Rotated left by 11000100101111011at 16 bits, wrapping

Shifted left by 111000100101111010= 100,730, no wrap

Shifted right by 1110001001011110= 25,182, discarding the low bit

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

Nearest landmarks

Next prime50,377+12

Previous prime50,363−2

Distance to nearest prime2

Nearest square below50,176

Nearest square above50,625

Powers & multiples

50,365 to the power 22,536,633,225

50,365 to the power 3127,757,532,377,125

50,365 to the power 46,434,508,118,173,900,625

50,365 to the power 5324,074,001,371,828,504,978,125

First ten multiples50,365, 100,730, 151,095, 201,460, 251,825, 302,190, 352,555, 402,920, 453,285, 503,650

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 5Yes

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 1233the total stopping time

Highest value reached6,810,136135× the starting value

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

First steps50,365 → 151,096 → 75,548 → 37,774 → 18,887 → 56,662 → 28,331 → 84,994 → 42,497 → 127,492 → …

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

As a percentage & fraction

As a percentage5,036,500%

50,365% as a decimal503.65

50,365% of 10050,365

50,365% of 1,000503,650

As a fraction of 10050,365/100

Read another way

As seconds13 hours, 59 minutes and 25 seconds

As bytes49.185 KiB

As a 24-bit colour#00C4BD

Keep nerding

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