Recognised as Number

50,271

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value50,271

Digit count5

Digit sum15

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 13 × 1,289

Distinct prime factors33, 13, 1,289

Number of divisors8

Sum of divisors σ(n)72,240

Aliquot sum21,969sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)3,864the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 30,912

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 13, 39, 1,289, 3,867, 16,757, 50,2718 in total

Arithmetic

Previous number50,270

Next number50,272

Double100,542

Half25,135.5

Square2,527,173,441

Cube127,043,536,052,511

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

Cube root36.906753268≈

Negation-50,271

Reciprocal0.0000198922≈

Representations

Decimal50,271

Binary110001000101111116 bits

Octal142137

HexadecimalC45F

Base 3612SF

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

In wordsfifty thousand, two hundred and seventy-one

Ordinalfifty thousand, two hundred and seventy-first

Scientific notation5.0271 × 10^4

Engineering notation50.271 × 10^3

In other bases

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

Quinary3102041base 5; one hand: 7 digits

Septenary266364base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100010001011111

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

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

At each machine width

16-bit1100010001011111

32-bit00000000000000001100010001011111

64-bit0000000000000000000000000000000000000000000000001100010001011111

One's complement0011101110100000at 16 bits, every bit flipped

Bits reversed1111101000100011at 16 bits

Rotated left by 11000100010111111at 16 bits, wrapping

Shifted left by 111000100010111110= 100,542, no wrap

Shifted right by 1110001000101111= 25,135, discarding the low bit

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

Nearest landmarks

Next prime50,273+2

Previous prime50,263−8

Distance to nearest prime2

Nearest square below50,176

Nearest square above50,625

Powers & multiples

50,271 to the power 22,527,173,441

50,271 to the power 3127,043,536,052,511

50,271 to the power 46,386,605,600,895,780,481

50,271 to the power 5321,061,050,162,631,780,560,351

First ten multiples50,271, 100,542, 150,813, 201,084, 251,355, 301,626, 351,897, 402,168, 452,439, 502,710

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 3

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1140the total stopping time

Highest value reached815,34416× the starting value

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

First steps50,271 → 150,814 → 75,407 → 226,222 → 113,111 → 339,334 → 169,667 → 509,002 → 254,501 → 763,504 → …

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

As a percentage & fraction

As a percentage5,027,100%

50,271% as a decimal502.71

50,271% of 10050,271

50,271% of 1,000502,710

As a fraction of 10050,271/100

Read another way

As seconds13 hours, 57 minutes and 51 seconds

As bytes49.093 KiB

As a 24-bit colour#00C45F

Keep nerding

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