Recognised as Number

49,370

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value49,370

Digit count5

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 4,937

Distinct prime factors32, 5, 4,937

Number of divisors8

Sum of divisors σ(n)88,884

Aliquot sum39,514sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,936the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,744

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 4,937, 9,874, 24,685, 49,3708 in total

Arithmetic

Previous number49,369

Next number49,371

Double98,740

Half24,685

Square2,437,396,900

Cube120,334,284,953,000

Square root222.193609269≈irrational, shown to 9 decimal places

Cube root36.684931213≈

Negation-49,370

Reciprocal0.0000202552≈

Representations

Decimal49,370

Binary110000001101101016 bits

Octal140332

HexadecimalC0DA

Base 36123E

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

In wordsforty-nine thousand, three hundred and seventy

Ordinalforty-nine thousand, three hundred and seventieth

Scientific notation4.937 × 10^4

Engineering notation49.37 × 10^3

In other bases

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

Quinary3034440base 5; one hand: 7 digits

Septenary263636base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100000011011010

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

Bytes2c0 da

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

At each machine width

16-bit1100000011011010

32-bit00000000000000001100000011011010

64-bit0000000000000000000000000000000000000000000000001100000011011010

One's complement0011111100100101at 16 bits, every bit flipped

Bits reversed0101101100000011at 16 bits

Rotated left by 11000000110110101at 16 bits, wrapping

Shifted left by 111000000110110100= 98,740, no wrap

Shifted right by 1110000001101101= 24,685, discarding the low bit

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

Nearest landmarks

Next prime49,391+21

Previous prime49,369−1

Distance to nearest prime1

Nearest square below49,284

Nearest square above49,729

Powers & multiples

49,370 to the power 22,437,396,900

49,370 to the power 3120,334,284,953,000

49,370 to the power 45,940,903,648,129,610,000

49,370 to the power 5293,302,413,108,158,845,700,000

First ten multiples49,370, 98,740, 148,110, 197,480, 246,850, 296,220, 345,590, 394,960, 444,330, 493,700

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 2

Divisible by 12No, remainder 2

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1264the total stopping time

Highest value reached975,40019× the starting value

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

First steps49,370 → 24,685 → 74,056 → 37,028 → 18,514 → 9,257 → 27,772 → 13,886 → 6,943 → 20,830 → …

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

As a percentage & fraction

As a percentage4,937,000%

49,370% as a decimal493.7

49,370% of 10049,370

49,370% of 1,000493,700

As a fraction of 10049,370/100

Read another way

As seconds13 hours, 42 minutes and 50 seconds

As bytes48.213 KiB

As a 24-bit colour#00C0DA

Keep nerding

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