Nerdulator> put something in

Recognised as Number

49,750

  • Positive
  • Even
  • Composite
  • 5 digits

49,750 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value49,750
Digit count5
Digit sum25
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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5^3 × 199
Distinct prime factors32, 5, 199
Number of divisors16
Sum of divisors σ(n)93,600
Aliquot sum43,850sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)19,800integers below n that share no factor with it
Carmichael function λ(n)9,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,800
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 10, 25, 50, 125, 199, 250, 398, 995, 1,990, 4,975, 9,950, 24,875, 49,75016 in total

Arithmetic

Previous number49,749
Next number49,751
Double99,500
Half24,875
Square root223.047080232≈irrational, shown to 9 decimal places
Cube root36.778811842≈
Negation-49,750
Reciprocal0.0000201005≈

Representations

Decimal49,750
Binary110000100101011016 bits
Octal141126
HexadecimalC256
Base 3612DY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-nine thousand, seven hundred and fifty
Ordinalforty-nine thousand, seven hundred and fiftieth
Scientific notation4.975 × 10^4
Engineering notation49.75 × 10^3

In other bases

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

Bit-level

1100001001010110
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 11 trailing zero
Power of twoNo
Bytes2c2 56
Gray code1010001101111101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100001001010110
32-bit00000000000000001100001001010110
64-bit0000000000000000000000000000000000000000000000001100001001010110
One's complement0011110110101001at 16 bits, every bit flipped
Bits reversed0110101001000011at 16 bits
Rotated left by 11000010010101101at 16 bits, wrapping
Shifted left by 111000010010101100= 99,500, no wrap
Shifted right by 1110000100101011= 24,875, discarding the low bit
These bits as a double2.45797659 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime49,757+7
Previous prime49,747−3
Distance to nearest prime3
Nearest square below49,729
Nearest square above50,176

Powers & multiples

49,750 to the power 22,475,062,500
49,750 to the power 3123,134,359,375,000
49,750 to the power 46,125,934,378,906,250,000
49,750 to the power 5304,765,235,350,585,937,500,000
First ten multiples49,750, 99,500, 149,250, 199,000, 248,750, 298,500, 348,250, 398,000, 447,750, 497,500
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 196the total stopping time
Highest value reached179,3323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps49,750 → 24,875 → 74,626 → 37,313 → 111,940 → 55,970 → 27,985 → 83,956 → 41,978 → 20,989 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,975,000%
49,750% as a decimal497.5
49,750% of 10049,750
49,750% of 1,000497,500
As a fraction of 10049,750/100

Read another way

As bytes48.584 KiB
As a 24-bit colour#00C256

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