Nerdulator> put something in

Recognised as Number

50,632

  • Positive
  • Even
  • Composite
  • 5 digits

50,632 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value50,632
Digit count5
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 6,329
Distinct prime factors22, 6,329
Number of divisors8
Sum of divisors σ(n)94,950
Aliquot sum44,318sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)25,312integers below n that share no factor with it
Carmichael function λ(n)6,328the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,312
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 6,329, 12,658, 25,316, 50,6328 in total

Arithmetic

Previous number50,631
Next number50,633
Double101,264
Half25,316
Square root225.015555018≈irrational, shown to 9 decimal places
Cube root36.994886072≈
Negation-50,632
Reciprocal0.0000197504≈

Representations

Decimal50,632
Binary110001011100100016 bits
Octal142710
HexadecimalC5C8
Base 36132G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty thousand, six hundred and thirty-two
Ordinalfifty thousand, six hundred and thirty-second
Scientific notation5.0632 × 10^4
Engineering notation50.632 × 10^3

In other bases

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

Bit-level

1100010111001000
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes2c5 c8
Gray code1010011100101100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100010111001000
32-bit00000000000000001100010111001000
64-bit0000000000000000000000000000000000000000000000001100010111001000
One's complement0011101000110111at 16 bits, every bit flipped
Bits reversed0001001110100011at 16 bits
Rotated left by 11000101110010001at 16 bits, wrapping
Shifted left by 111000101110010000= 101,264, no wrap
Shifted right by 1110001011100100= 25,316, discarding the low bit
These bits as a double2.50155318 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime50,647+15
Previous prime50,627−5
Distance to nearest prime5
Nearest square below50,625
Nearest square above51,076

Powers & multiples

50,632 to the power 22,563,599,424
50,632 to the power 3129,800,166,035,968
50,632 to the power 46,572,042,006,733,131,776
50,632 to the power 5332,755,630,884,911,928,082,432
First ten multiples50,632, 101,264, 151,896, 202,528, 253,160, 303,792, 354,424, 405,056, 455,688, 506,320
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 4
Divisible by 100No, remainder 32

Collatz (3n + 1) trajectory

Steps to reach 1158the total stopping time
Highest value reached50,632
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps50,632 → 25,316 → 12,658 → 6,329 → 18,988 → 9,494 → 4,747 → 14,242 → 7,121 → 21,364 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,063,200%
50,632% as a decimal506.32
50,632% of 10050,632
50,632% of 1,000506,320
As a fraction of 10050,632/100

Read another way

As bytes49.445 KiB
As a 24-bit colour#00C5C8

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