Recognised as Number

50,273

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value50,273

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 factorisation50,273

Distinct prime factors150,273

Number of divisors2

Sum of divisors σ(n)50,274

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)50,272the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 50,2732 in total

Arithmetic

Previous number50,272

Next number50,274

Double100,546

Half25,136.5

Square2,527,374,529

Cube127,058,699,696,417

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

Cube root36.907242699≈

Negation-50,273

Reciprocal0.0000198914≈

Representations

Decimal50,273

Binary110001000110000116 bits

Octal142141

HexadecimalC461

Base 3612SH

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

In wordsfifty thousand, two hundred and seventy-three

Ordinalfifty thousand, two hundred and seventy-third

Scientific notation5.0273 × 10^4

Engineering notation50.273 × 10^3

In other bases

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

Quinary3102043base 5; one hand: 7 digits

Septenary266366base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100010001100001

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 61

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

At each machine width

16-bit1100010001100001

32-bit00000000000000001100010001100001

64-bit0000000000000000000000000000000000000000000000001100010001100001

One's complement0011101110011110at 16 bits, every bit flipped

Bits reversed1000011000100011at 16 bits

Rotated left by 11000100011000011at 16 bits, wrapping

Shifted left by 111000100011000010= 100,546, no wrap

Shifted right by 1110001000110000= 25,136, discarding the low bit

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

Nearest landmarks

Next prime50,287+14

Previous prime50,263−10

Distance to nearest prime0, it is prime

Nearest square below50,176

Nearest square above50,625

Powers & multiples

50,273 to the power 22,527,374,529

50,273 to the power 3127,058,699,696,417

50,273 to the power 46,387,622,009,837,971,841

50,273 to the power 5321,124,921,300,584,358,362,593

First ten multiples50,273, 100,546, 150,819, 201,092, 251,365, 301,638, 351,911, 402,184, 452,457, 502,730

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 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 3

Divisible by 12No, remainder 5

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1109the total stopping time

Highest value reached190,8883× the starting value

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

First steps50,273 → 150,820 → 75,410 → 37,705 → 113,116 → 56,558 → 28,279 → 84,838 → 42,419 → 127,258 → …

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

As a percentage & fraction

As a percentage5,027,300%

50,273% as a decimal502.73

50,273% of 10050,273

50,273% of 1,000502,730

As a fraction of 10050,273/100

Read another way

As seconds13 hours, 57 minutes and 53 seconds

As bytes49.095 KiB

As a 24-bit colour#00C461

Keep nerding

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