Recognised as Number

48,279

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value48,279

Digit count5

Digit sum30

Digit product4,032

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 11^2 × 19

Distinct prime factors43, 7, 11, 19

Number of divisors24

Sum of divisors σ(n)85,120

Aliquot sum36,841sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)990the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,760

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 11, 19, 21, 33, 57, 77, 121, 133, 209, 231, 363, 399, 627, 847, 1,463, 2,299, 2,541, 4,389, 6,897, 16,093, 48,27924 in total

Arithmetic

Previous number48,278

Next number48,280

Double96,558

Half24,139.5

Square2,330,861,841

Cube112,531,678,821,639

Square root219.72482791≈irrational, shown to 9 decimal places

Cube root36.412689292≈

Negation-48,279

Reciprocal0.0000207129≈

Representations

Decimal48,279

Binary101111001001011116 bits

Octal136227

HexadecimalBC97

Base 361193

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

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

Ordinalforty-eight thousand, two hundred and seventy-ninth

Scientific notation4.8279 × 10^4

Engineering notation48.279 × 10^3

In other bases

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

Quinary3021104base 5; one hand: 7 digits

Septenary260520base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011110010010111

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

Bit parityeven10 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

Bytes2bc 97

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

At each machine width

16-bit1011110010010111

32-bit00000000000000001011110010010111

64-bit0000000000000000000000000000000000000000000000001011110010010111

One's complement0100001101101000at 16 bits, every bit flipped

Bits reversed1110100100111101at 16 bits

Rotated left by 10111100100101111at 16 bits, wrapping

Shifted left by 110111100100101110= 96,558, no wrap

Shifted right by 1101111001001011= 24,139, discarding the low bit

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

Nearest landmarks

Next prime48,281+2

Previous prime48,271−8

Distance to nearest prime2

Nearest square below47,961

Nearest square above48,400

Powers & multiples

48,279 to the power 22,330,861,841

48,279 to the power 3112,531,678,821,639

48,279 to the power 45,432,916,921,829,909,281

48,279 to the power 5262,295,796,069,026,190,177,399

First ten multiples48,279, 96,558, 144,837, 193,116, 241,395, 289,674, 337,953, 386,232, 434,511, 482,790

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 4

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 144the total stopping time

Highest value reached325,8886× the starting value

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

First steps48,279 → 144,838 → 72,419 → 217,258 → 108,629 → 325,888 → 162,944 → 81,472 → 40,736 → 20,368 → …

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

As a percentage & fraction

As a percentage4,827,900%

48,279% as a decimal482.79

48,279% of 10048,279

48,279% of 1,000482,790

As a fraction of 10048,279/100

Read another way

As seconds13 hours, 24 minutes and 39 seconds

As bytes47.147 KiB

As a 24-bit colour#00BC97

Keep nerding

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