Nerdulator> put something in

Recognised as Number

50,647

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value50,647
Digit count5
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation50,647
Distinct prime factors150,647
Number of divisors2
Sum of divisors σ(n)50,648
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)50,646integers below n that share no factor with it
Carmichael function λ(n)50,646the 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,6472 in total

Arithmetic

Previous number50,646
Next number50,648
Double101,294
Square root225.048883579≈irrational, shown to 9 decimal places
Cube root36.998539022≈
Negation-50,647
Reciprocal0.0000197445≈

Representations

Decimal50,647
Binary110001011101011116 bits
Octal142727
HexadecimalC5D7
Base 36132V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty thousand, six hundred and forty-seven
Ordinalfifty thousand, six hundred and forty-seventh
Scientific notation5.0647 × 10^4
Engineering notation50.647 × 10^3

In other bases

Ternary2120110211base 3; the most digit-efficient integer base after e: 10 digits
Quinary3110042base 5; one hand: 7 digits
Septenary300442base 7: 6 digits
Nonary76424base 9; each digit is two ternary digits: 5 digits
Duodecimal25387base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal66c7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:4:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10TT0111T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101101000101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1100010111010111
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 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
Bytes2c5 d7
Gray code1010011100111100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100010111010111
32-bit00000000000000001100010111010111
64-bit0000000000000000000000000000000000000000000000001100010111010111
One's complement0011101000101000at 16 bits, every bit flipped
Bits reversed1110101110100011at 16 bits
Rotated left by 11000101110101111at 16 bits, wrapping
Shifted left by 111000101110101110= 101,294, no wrap
Shifted right by 1110001011101011= 25,323, discarding the low bit
These bits as a double2.50229428 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime50,651+4
Previous prime50,627−20
Distance to nearest prime0, it is prime
Nearest square below50,625
Nearest square above51,076

Powers & multiples

50,647 to the power 22,565,118,609
50,647 to the power 3129,915,562,190,023
50,647 to the power 46,579,833,478,238,094,881
50,647 to the power 5333,248,826,172,324,791,438,007
First ten multiples50,647, 101,294, 151,941, 202,588, 253,235, 303,882, 354,529, 405,176, 455,823, 506,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 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47

Collatz (3n + 1) trajectory

Steps to reach 1109the total stopping time
Highest value reached341,8726× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps50,647 → 151,942 → 75,971 → 227,914 → 113,957 → 341,872 → 170,936 → 85,468 → 42,734 → 21,367 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,064,700%
50,647% as a decimal506.47
50,647% of 10050,647
50,647% of 1,000506,470
As a fraction of 10050,647/100

Read another way

As bytes49.46 KiB
As a 24-bit colour#00C5D7

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “50647” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.