Recognised as Number

49,100

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value49,100

Digit count5

Digit sum14

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^2 × 5^2 × 491

Distinct prime factors32, 5, 491

Number of divisors18

Sum of divisors σ(n)106,764

Aliquot sum57,664sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 10, 20, 25, 50, 100, 491, 982, 1,964, 2,455, 4,910, 9,820, 12,275, 24,550, 49,10018 in total

Arithmetic

Previous number49,099

Next number49,101

Double98,200

Half24,550

Square2,410,810,000

Cube118,370,771,000,000

Square root221.585198062≈irrational, shown to 9 decimal places

Cube root36.617933421≈

Negation-49,100

Reciprocal0.0000203666≈

Representations

Decimal49,100

Binary101111111100110016 bits

Octal137714

HexadecimalBFCC

Base 3611VW

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

In wordsforty-nine thousand, one hundred

Ordinalforty-nine thousand, one hundredth

Scientific notation4.91 × 10^4

Engineering notation49.1 × 10^3

In other bases

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

Quinary3032400base 5; one hand: 7 digits

Septenary263102base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011111111001100

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes2bf cc

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

At each machine width

16-bit1011111111001100

32-bit00000000000000001011111111001100

64-bit0000000000000000000000000000000000000000000000001011111111001100

One's complement0100000000110011at 16 bits, every bit flipped

Bits reversed0011001111111101at 16 bits

Rotated left by 10111111110011001at 16 bits, wrapping

Shifted left by 110111111110011000= 98,200, no wrap

Shifted right by 1101111111100110= 24,550, discarding the low bit

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

Nearest landmarks

Next prime49,103+3

Previous prime49,081−19

Distance to nearest prime3

Nearest square below48,841

Nearest square above49,284

Powers & multiples

49,100 to the power 22,410,810,000

49,100 to the power 3118,370,771,000,000

49,100 to the power 45,812,004,856,100,000,000

49,100 to the power 5285,369,438,434,510,000,000,000

First ten multiples49,100, 98,200, 147,300, 196,400, 245,500, 294,600, 343,700, 392,800, 441,900, 491,000

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8No, remainder 4

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 7

Divisible by 12No, remainder 8

Divisible by 100Yes

Collatz (3n + 1) trajectory

Steps to reach 1127the total stopping time

Highest value reached95,9561× the starting value

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

First steps49,100 → 24,550 → 12,275 → 36,826 → 18,413 → 55,240 → 27,620 → 13,810 → 6,905 → 20,716 → …

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

As a percentage & fraction

As a percentage4,910,000%

49,100% as a decimal491

49,100% of 10049,100

49,100% of 1,000491,000

As a fraction of 10049,100/100

Read another way

As seconds13 hours, 38 minutes and 20 seconds

As bytes47.949 KiB

As a 24-bit colour#00BFCC

Keep nerding

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