Recognised as Number

50,347

Positive
Odd
Composite
5 digits

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

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 factorisation11 × 23 × 199

Distinct prime factors311, 23, 199

Number of divisors8

Sum of divisors σ(n)57,600

Aliquot sum7,253sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 23, 199, 253, 2,189, 4,577, 50,3478 in total

Arithmetic

Previous number50,346

Next number50,348

Double100,694

Half25,173.5

Square2,534,820,409

Cube127,620,603,131,923

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

Cube root36.92534252≈

Negation-50,347

Reciprocal0.0000198622≈

Representations

Decimal50,347

Binary110001001010101116 bits

Octal142253

HexadecimalC4AB

Base 3612UJ

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

In wordsfifty thousand, three hundred and forty-seven

Ordinalfifty thousand, three hundred and forty-seventh

Scientific notation5.0347 × 10^4

Engineering notation50.347 × 10^3

In other bases

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

Quinary3102342base 5; one hand: 7 digits

Septenary266533base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100010010101011

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

Bytes2c4 ab

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

At each machine width

16-bit1100010010101011

32-bit00000000000000001100010010101011

64-bit0000000000000000000000000000000000000000000000001100010010101011

One's complement0011101101010100at 16 bits, every bit flipped

Bits reversed1101010100100011at 16 bits

Rotated left by 11000100101010111at 16 bits, wrapping

Shifted left by 111000100101010110= 100,694, no wrap

Shifted right by 1110001001010101= 25,173, discarding the low bit

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

Nearest landmarks

Next prime50,359+12

Previous prime50,341−6

Distance to nearest prime6

Nearest square below50,176

Nearest square above50,625

Powers & multiples

50,347 to the power 22,534,820,409

50,347 to the power 3127,620,603,131,923

50,347 to the power 46,425,314,505,882,927,281

50,347 to the power 5323,495,309,427,687,739,816,507

First ten multiples50,347, 100,694, 151,041, 201,388, 251,735, 302,082, 352,429, 402,776, 453,123, 503,470

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 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11Yes

Divisible by 12No, remainder 7

Divisible by 100No, remainder 47

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time

Highest value reached226,5644× the starting value

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

First steps50,347 → 151,042 → 75,521 → 226,564 → 113,282 → 56,641 → 169,924 → 84,962 → 42,481 → 127,444 → …

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

As a percentage & fraction

As a percentage5,034,700%

50,347% as a decimal503.47

50,347% of 10050,347

50,347% of 1,000503,470

As a fraction of 10050,347/100

Read another way

As seconds13 hours, 59 minutes and 7 seconds

As bytes49.167 KiB

As a 24-bit colour#00C4AB

Keep nerding

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