Recognised as Number

50,862

Positive
Even
Composite
5 digits

50,862 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value50,862

Digit count5

Digit sum21

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 7^2 × 173

Distinct prime factors42, 3, 7, 173

Number of divisors24

Sum of divisors σ(n)119,016

Aliquot sum68,154sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 147, 173, 294, 346, 519, 1,038, 1,211, 2,422, 3,633, 7,266, 8,477, 16,954, 25,431, 50,86224 in total

Arithmetic

Previous number50,861

Next number50,863

Double101,724

Half25,431

Square2,586,943,044

Cube131,577,097,103,928

Square root225.52605171≈irrational, shown to 9 decimal places

Cube root37.050818896≈

Negation-50,862

Reciprocal0.000019661≈

Representations

Decimal50,862

Binary110001101010111016 bits

Octal143256

HexadecimalC6AE

Base 36138U

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

In wordsfifty thousand, eight hundred and sixty-two

Ordinalfifty thousand, eight hundred and sixty-second

Scientific notation5.0862 × 10^4

Engineering notation50.862 × 10^3

In other bases

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

Quinary3111422base 5; one hand: 7 digits

Septenary301200base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100011010101110

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2c6 ae

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

At each machine width

16-bit1100011010101110

32-bit00000000000000001100011010101110

64-bit0000000000000000000000000000000000000000000000001100011010101110

One's complement0011100101010001at 16 bits, every bit flipped

Bits reversed0111010101100011at 16 bits

Rotated left by 11000110101011101at 16 bits, wrapping

Shifted left by 111000110101011100= 101,724, no wrap

Shifted right by 1110001101010111= 25,431, discarding the low bit

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

Nearest landmarks

Next prime50,867+5

Previous prime50,857−5

Distance to nearest prime5

Nearest square below50,625

Nearest square above51,076

Powers & multiples

50,862 to the power 22,586,943,044

50,862 to the power 3131,577,097,103,928

50,862 to the power 46,692,274,312,899,985,936

50,862 to the power 5340,382,456,102,719,084,676,832

First ten multiples50,862, 101,724, 152,586, 203,448, 254,310, 305,172, 356,034, 406,896, 457,758, 508,620

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7Yes

Divisible by 8No, remainder 6

Divisible by 9No, remainder 3

Divisible by 10No, remainder 2

Divisible by 11No, remainder 9

Divisible by 12No, remainder 6

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 157the total stopping time

Highest value reached171,6643× the starting value

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

First steps50,862 → 25,431 → 76,294 → 38,147 → 114,442 → 57,221 → 171,664 → 85,832 → 42,916 → 21,458 → …

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

As a percentage & fraction

As a percentage5,086,200%

50,862% as a decimal508.62

50,862% of 10050,862

50,862% of 1,000508,620

As a fraction of 10050,862/100

Read another way

As seconds14 hours, 7 minutes and 42 seconds

As bytes49.67 KiB

As a 24-bit colour#00C6AE

Keep nerding

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