Recognised as Number

48,949

Positive
Odd
Composite
5 digits

48,949 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value48,949

Digit count5

Digit sum34

Digit product10,368

Multiplicative persistence2times 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 factorisation31 × 1,579

Distinct prime factors231, 1,579

Number of divisors4

Sum of divisors σ(n)50,560

Aliquot sum1,611sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)7,890the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 47,340

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 31, 1,579, 48,9494 in total

Arithmetic

Previous number48,948

Next number48,950

Double97,898

Half24,474.5

Square2,396,004,601

Cube117,282,029,214,349

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

Cube root36.580357143≈

Negation-48,949

Reciprocal0.0000204294≈

Representations

Decimal48,949

Binary101111110011010116 bits

Octal137465

HexadecimalBF35

Base 3611RP

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

In wordsforty-eight thousand, nine hundred and forty-nine

Ordinalforty-eight thousand, nine hundred and forty-ninth

Scientific notation4.8949 × 10^4

Engineering notation48.949 × 10^3

In other bases

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

Quinary3031244base 5; one hand: 7 digits

Septenary262465base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011111100110101

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2bf 35

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

At each machine width

16-bit1011111100110101

32-bit00000000000000001011111100110101

64-bit0000000000000000000000000000000000000000000000001011111100110101

One's complement0100000011001010at 16 bits, every bit flipped

Bits reversed1010110011111101at 16 bits

Rotated left by 10111111001101011at 16 bits, wrapping

Shifted left by 110111111001101010= 97,898, no wrap

Shifted right by 1101111110011010= 24,474, discarding the low bit

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

Nearest landmarks

Next prime48,953+4

Previous prime48,947−2

Distance to nearest prime2

Nearest square below48,841

Nearest square above49,284

Powers & multiples

48,949 to the power 22,396,004,601

48,949 to the power 3117,282,029,214,349

48,949 to the power 45,740,838,048,013,169,201

48,949 to the power 5281,008,281,612,196,619,219,749

First ten multiples48,949, 97,898, 146,847, 195,796, 244,745, 293,694, 342,643, 391,592, 440,541, 489,490

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 1

Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time

Highest value reached146,8483× the starting value

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

First steps48,949 → 146,848 → 73,424 → 36,712 → 18,356 → 9,178 → 4,589 → 13,768 → 6,884 → 3,442 → …

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

As a percentage & fraction

As a percentage4,894,900%

48,949% as a decimal489.49

48,949% of 10048,949

48,949% of 1,000489,490

As a fraction of 10048,949/100

Read another way

As seconds13 hours, 35 minutes and 49 seconds

As bytes47.802 KiB

As a 24-bit colour#00BF35

Keep nerding

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