Recognised as Number

48,951

Positive
Odd
Composite
5 digits

48,951 is an odd 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value48,951

Digit count5

Digit sum27

Digit product1,440

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^3 × 7^2 × 37

Distinct prime factors33, 7, 37

Number of divisors24

Sum of divisors σ(n)86,640

Aliquot sum37,689sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)252the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,216

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 21, 27, 37, 49, 63, 111, 147, 189, 259, 333, 441, 777, 999, 1,323, 1,813, 2,331, 5,439, 6,993, 16,317, 48,95124 in total

Arithmetic

Previous number48,950

Next number48,952

Double97,902

Half24,475.5

Square2,396,200,401

Cube117,296,405,829,351

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

Cube root36.580855346≈

Negation-48,951

Reciprocal0.0000204286≈

Representations

Decimal48,951

Binary101111110011011116 bits

Octal137467

HexadecimalBF37

Base 3611RR

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

In wordsforty-eight thousand, nine hundred and fifty-one

Ordinalforty-eight thousand, nine hundred and fifty-first

Scientific notation4.8951 × 10^4

Engineering notation48.951 × 10^3

In other bases

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

Quinary3031301base 5; one hand: 7 digits

Septenary262500base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011111100110111

Bit length16 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits4within that length

Bit parityeven12 set bits, so even; 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 37

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

At each machine width

16-bit1011111100110111

32-bit00000000000000001011111100110111

64-bit0000000000000000000000000000000000000000000000001011111100110111

One's complement0100000011001000at 16 bits, every bit flipped

Bits reversed1110110011111101at 16 bits

Rotated left by 10111111001101111at 16 bits, wrapping

Shifted left by 110111111001101110= 97,902, no wrap

Shifted right by 1101111110011011= 24,475, discarding the low bit

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

Nearest landmarks

Next prime48,953+2

Previous prime48,947−4

Distance to nearest prime2

Nearest square below48,841

Nearest square above49,284

Powers & multiples

48,951 to the power 22,396,200,401

48,951 to the power 3117,296,405,829,351

48,951 to the power 45,741,776,361,752,560,801

48,951 to the power 5281,065,694,684,149,603,769,751

First ten multiples48,951, 97,902, 146,853, 195,804, 244,755, 293,706, 342,657, 391,608, 440,559, 489,510

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 3

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1158the total stopping time

Highest value reached330,4246× the starting value

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

First steps48,951 → 146,854 → 73,427 → 220,282 → 110,141 → 330,424 → 165,212 → 82,606 → 41,303 → 123,910 → …

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

As a percentage & fraction

As a percentage4,895,100%

48,951% as a decimal489.51

48,951% of 10048,951

48,951% of 1,000489,510

As a fraction of 10048,951/100

Read another way

As seconds13 hours, 35 minutes and 51 seconds

As bytes47.804 KiB

As a 24-bit colour#00BF37

Keep nerding

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