Recognised as Number

48,971

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value48,971

Digit count5

Digit sum29

Digit product2,016

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13 × 3,767

Distinct prime factors213, 3,767

Number of divisors4

Sum of divisors σ(n)52,752

Aliquot sum3,781sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)22,596the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 45,192

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

SquarefreeYesno repeated prime factor

All divisors1, 13, 3,767, 48,9714 in total

Arithmetic

Previous number48,970

Next number48,972

Double97,942

Half24,485.5

Square2,398,158,841

Cube117,440,236,602,611

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

Cube root36.585836637≈

Negation-48,971

Reciprocal0.0000204202≈

Representations

Decimal48,971

Binary101111110100101116 bits

Octal137513

HexadecimalBF4B

Base 3611SB

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

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

Ordinalforty-eight thousand, nine hundred and seventy-first

Scientific notation4.8971 × 10^4

Engineering notation48.971 × 10^3

In other bases

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

Quinary3031341base 5; one hand: 7 digits

Septenary262526base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011111101001011

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 4b

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

At each machine width

16-bit1011111101001011

32-bit00000000000000001011111101001011

64-bit0000000000000000000000000000000000000000000000001011111101001011

One's complement0100000010110100at 16 bits, every bit flipped

Bits reversed1101001011111101at 16 bits

Rotated left by 10111111010010111at 16 bits, wrapping

Shifted left by 110111111010010110= 97,942, no wrap

Shifted right by 1101111110100101= 24,485, discarding the low bit

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

Nearest landmarks

Next prime48,973+2

Previous prime48,953−18

Distance to nearest prime2

Nearest square below48,841

Nearest square above49,284

Powers & multiples

48,971 to the power 22,398,158,841

48,971 to the power 3117,440,236,602,611

48,971 to the power 45,751,165,826,666,463,281

48,971 to the power 5281,640,341,697,683,373,333,851

First ten multiples48,971, 97,942, 146,913, 195,884, 244,855, 293,826, 342,797, 391,768, 440,739, 489,710

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 10

Divisible by 12No, remainder 11

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time

Highest value reached220,3724× the starting value

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

First steps48,971 → 146,914 → 73,457 → 220,372 → 110,186 → 55,093 → 165,280 → 82,640 → 41,320 → 20,660 → …

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

As a percentage & fraction

As a percentage4,897,100%

48,971% as a decimal489.71

48,971% of 10048,971

48,971% of 1,000489,710

As a fraction of 10048,971/100

Read another way

As seconds13 hours, 36 minutes and 11 seconds

As bytes47.823 KiB

As a 24-bit colour#00BF4B

Keep nerding

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