Recognised as Number

48,243

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value48,243

Digit count5

Digit sum21

Digit product768

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 13 × 1,237

Distinct prime factors33, 13, 1,237

Number of divisors8

Sum of divisors σ(n)69,328

Aliquot sum21,085sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,236the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 29,664

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 13, 39, 1,237, 3,711, 16,081, 48,2438 in total

Arithmetic

Previous number48,242

Next number48,244

Double96,486

Half24,121.5

Square2,327,387,049

Cube112,280,133,404,907

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

Cube root36.403636476≈

Negation-48,243

Reciprocal0.0000207284≈

Representations

Decimal48,243

Binary101111000111001116 bits

Octal136163

HexadecimalBC73

Base 361183

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

In wordsforty-eight thousand, two hundred and forty-three

Ordinalforty-eight thousand, two hundred and forty-third

Scientific notation4.8243 × 10^4

Engineering notation48.243 × 10^3

In other bases

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

Quinary3020433base 5; one hand: 7 digits

Septenary260436base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011110001110011

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 73

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

At each machine width

16-bit1011110001110011

32-bit00000000000000001011110001110011

64-bit0000000000000000000000000000000000000000000000001011110001110011

One's complement0100001110001100at 16 bits, every bit flipped

Bits reversed1100111000111101at 16 bits

Rotated left by 10111100011100111at 16 bits, wrapping

Shifted left by 110111100011100110= 96,486, no wrap

Shifted right by 1101111000111001= 24,121, discarding the low bit

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

Nearest landmarks

Next prime48,247+4

Previous prime48,239−4

Distance to nearest prime4

Nearest square below47,961

Nearest square above48,400

Powers & multiples

48,243 to the power 22,327,387,049

48,243 to the power 3112,280,133,404,907

48,243 to the power 45,416,730,475,852,928,401

48,243 to the power 5261,319,328,346,572,824,849,443

First ten multiples48,243, 96,486, 144,729, 192,972, 241,215, 289,458, 337,701, 385,944, 434,187, 482,430

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 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 3

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 3

Divisible by 100No, remainder 43

Collatz (3n + 1) trajectory

Steps to reach 1145the total stopping time

Highest value reached217,0964× the starting value

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

First steps48,243 → 144,730 → 72,365 → 217,096 → 108,548 → 54,274 → 27,137 → 81,412 → 40,706 → 20,353 → …

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

As a percentage & fraction

As a percentage4,824,300%

48,243% as a decimal482.43

48,243% of 10048,243

48,243% of 1,000482,430

As a fraction of 10048,243/100

Read another way

As seconds13 hours, 24 minutes and 3 seconds

As bytes47.112 KiB

As a 24-bit colour#00BC73

Keep nerding

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