Recognised as Number

50,345

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value50,345

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 10,069

Distinct prime factors25, 10,069

Number of divisors4

Sum of divisors σ(n)60,420

Aliquot sum10,075sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)10,068the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 40,272

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 10,069, 50,3454 in total

Arithmetic

Previous number50,344

Next number50,346

Double100,690

Half25,172.5

Square2,534,619,025

Cube127,605,394,813,625

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

Cube root36.924853569≈

Negation-50,345

Reciprocal0.0000198629≈

Representations

Decimal50,345

Binary110001001010100116 bits

Octal142251

HexadecimalC4A9

Base 3612UH

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

In wordsfifty thousand, three hundred and forty-five

Ordinalfifty thousand, three hundred and forty-fifth

Scientific notation5.0345 × 10^4

Engineering notation50.345 × 10^3

In other bases

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

Quinary3102340base 5; one hand: 7 digits

Septenary266531base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100010010101001

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 a9

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

At each machine width

16-bit1100010010101001

32-bit00000000000000001100010010101001

64-bit0000000000000000000000000000000000000000000000001100010010101001

One's complement0011101101010110at 16 bits, every bit flipped

Bits reversed1001010100100011at 16 bits

Rotated left by 11000100101010011at 16 bits, wrapping

Shifted left by 111000100101010010= 100,690, no wrap

Shifted right by 1110001001010100= 25,172, discarding the low bit

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

Nearest landmarks

Next prime50,359+14

Previous prime50,341−4

Distance to nearest prime4

Nearest square below50,176

Nearest square above50,625

Powers & multiples

50,345 to the power 22,534,619,025

50,345 to the power 3127,605,394,813,625

50,345 to the power 46,424,293,601,891,950,625

50,345 to the power 5323,431,061,387,250,254,215,625

First ten multiples50,345, 100,690, 151,035, 201,380, 251,725, 302,070, 352,415, 402,760, 453,105, 503,450

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

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 5

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 45

Collatz (3n + 1) trajectory

Steps to reach 1114the total stopping time

Highest value reached1,290,32825× the starting value

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

First steps50,345 → 151,036 → 75,518 → 37,759 → 113,278 → 56,639 → 169,918 → 84,959 → 254,878 → 127,439 → …

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

As a percentage & fraction

As a percentage5,034,500%

50,345% as a decimal503.45

50,345% of 10050,345

50,345% of 1,000503,450

As a fraction of 10050,345/100

Read another way

As seconds13 hours, 59 minutes and 5 seconds

As bytes49.165 KiB

As a 24-bit colour#00C4A9

Keep nerding

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