Recognised as Number

50,369

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value50,369

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 factorisation11 × 19 × 241

Distinct prime factors311, 19, 241

Number of divisors8

Sum of divisors σ(n)58,080

Aliquot sum7,711sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)720the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 43,200

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 19, 209, 241, 2,651, 4,579, 50,3698 in total

Arithmetic

Previous number50,368

Next number50,370

Double100,738

Half25,184.5

Square2,537,036,161

Cube127,787,974,393,409

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

Cube root36.930720128≈

Negation-50,369

Reciprocal0.0000198535≈

Representations

Decimal50,369

Binary110001001100000116 bits

Octal142301

HexadecimalC4C1

Base 3612V5

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

In wordsfifty thousand, three hundred and sixty-nine

Ordinalfifty thousand, three hundred and sixty-ninth

Scientific notation5.0369 × 10^4

Engineering notation50.369 × 10^3

In other bases

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

Quinary3102434base 5; one hand: 7 digits

Septenary266564base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100010011000001

Bit length16 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits10within that length

Bit parityeven6 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 c1

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

At each machine width

16-bit1100010011000001

32-bit00000000000000001100010011000001

64-bit0000000000000000000000000000000000000000000000001100010011000001

One's complement0011101100111110at 16 bits, every bit flipped

Bits reversed1000001100100011at 16 bits

Rotated left by 11000100110000011at 16 bits, wrapping

Shifted left by 111000100110000010= 100,738, no wrap

Shifted right by 1110001001100000= 25,184, discarding the low bit

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

Nearest landmarks

Next prime50,377+8

Previous prime50,363−6

Distance to nearest prime6

Nearest square below50,176

Nearest square above50,625

Powers & multiples

50,369 to the power 22,537,036,161

50,369 to the power 3127,787,974,393,409

50,369 to the power 46,436,552,482,221,617,921

50,369 to the power 5324,202,711,977,020,673,062,849

First ten multiples50,369, 100,738, 151,107, 201,476, 251,845, 302,214, 352,583, 402,952, 453,321, 503,690

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 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time

Highest value reached151,1083× the starting value

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

First steps50,369 → 151,108 → 75,554 → 37,777 → 113,332 → 56,666 → 28,333 → 85,000 → 42,500 → 21,250 → …

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

As a percentage & fraction

As a percentage5,036,900%

50,369% as a decimal503.69

50,369% of 10050,369

50,369% of 1,000503,690

As a fraction of 10050,369/100

Read another way

As seconds13 hours, 59 minutes and 29 seconds

As bytes49.188 KiB

As a 24-bit colour#00C4C1

Keep nerding

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