Nerdulator> put something in

Recognised as Number

50,631

  • Positive
  • Odd
  • Composite
  • 5 digits

50,631 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,631
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 2,411
Distinct prime factors33, 7, 2,411
Number of divisors8
Sum of divisors σ(n)77,184
Aliquot sum26,553sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)28,920integers below n that share no factor with it
Carmichael function λ(n)7,230the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,920
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 2,411, 7,233, 16,877, 50,6318 in total

Arithmetic

Previous number50,630
Next number50,632
Double101,262
Square root225.013332938≈irrational, shown to 9 decimal places
Cube root36.994642516≈
Negation-50,631
Reciprocal0.0000197507≈

Representations

Decimal50,631
Binary110001011100011116 bits
Octal142707
HexadecimalC5C7
Base 36132F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty thousand, six hundred and thirty-one
Ordinalfifty thousand, six hundred and thirty-first
Scientific notation5.0631 × 10^4
Engineering notation50.631 × 10^3

In other bases

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

Bit-level

1100010111000111
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
Bytes2c5 c7
Gray code1010011100100100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100010111000111
32-bit00000000000000001100010111000111
64-bit0000000000000000000000000000000000000000000000001100010111000111
One's complement0011101000111000at 16 bits, every bit flipped
Bits reversed1110001110100011at 16 bits
Rotated left by 11000101110001111at 16 bits, wrapping
Shifted left by 111000101110001110= 101,262, no wrap
Shifted right by 1110001011100011= 25,315, discarding the low bit
These bits as a double2.50150377 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime50,647+16
Previous prime50,627−4
Distance to nearest prime4
Nearest square below50,625
Nearest square above51,076

Powers & multiples

50,631 to the power 22,563,498,161
50,631 to the power 3129,792,475,389,591
50,631 to the power 46,571,522,821,450,381,921
50,631 to the power 5332,722,771,972,854,287,042,151
First ten multiples50,631, 101,262, 151,893, 202,524, 253,155, 303,786, 354,417, 405,048, 455,679, 506,310
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 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 1109the total stopping time
Highest value reached584,65611× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps50,631 → 151,894 → 75,947 → 227,842 → 113,921 → 341,764 → 170,882 → 85,441 → 256,324 → 128,162 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,063,100%
50,631% as a decimal506.31
50,631% of 10050,631
50,631% of 1,000506,310
As a fraction of 10050,631/100

Read another way

As bytes49.444 KiB
As a 24-bit colour#00C5C7

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 “50631” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.