Recognised as Number

48,259

Positive
Odd
Prime
5 digits

48,259 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value48,259

Digit count5

Digit sum28

Digit product2,880

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation48,259

Distinct prime factors148,259

Number of divisors2

Sum of divisors σ(n)48,260

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)48,258the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 48,2592 in total

Arithmetic

Previous number48,258

Next number48,260

Double96,518

Half24,129.5

Square2,328,931,081

Cube112,391,885,037,979

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

Cube root36.407660506≈

Negation-48,259

Reciprocal0.0000207215≈

Representations

Decimal48,259

Binary101111001000001116 bits

Octal136203

HexadecimalBC83

Base 36118J

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

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

Ordinalforty-eight thousand, two hundred and fifty-ninth

Scientific notation4.8259 × 10^4

Engineering notation48.259 × 10^3

In other bases

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

Quinary3021014base 5; one hand: 7 digits

Septenary260461base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011110010000011

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 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 83

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

At each machine width

16-bit1011110010000011

32-bit00000000000000001011110010000011

64-bit0000000000000000000000000000000000000000000000001011110010000011

One's complement0100001101111100at 16 bits, every bit flipped

Bits reversed1100000100111101at 16 bits

Rotated left by 10111100100000111at 16 bits, wrapping

Shifted left by 110111100100000110= 96,518, no wrap

Shifted right by 1101111001000001= 24,129, discarding the low bit

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

Nearest landmarks

Next prime48,271+12

Previous prime48,247−12

Distance to nearest prime0, it is prime

Nearest square below47,961

Nearest square above48,400

Powers & multiples

48,259 to the power 22,328,931,081

48,259 to the power 3112,391,885,037,979

48,259 to the power 45,423,919,980,047,828,561

48,259 to the power 5261,752,954,317,128,158,525,299

First ten multiples48,259, 96,518, 144,777, 193,036, 241,295, 289,554, 337,813, 386,072, 434,331, 482,590

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 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 2

Divisible by 12No, remainder 7

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 152the total stopping time

Highest value reached217,1684× the starting value

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

First steps48,259 → 144,778 → 72,389 → 217,168 → 108,584 → 54,292 → 27,146 → 13,573 → 40,720 → 20,360 → …

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

As a percentage & fraction

As a percentage4,825,900%

48,259% as a decimal482.59

48,259% of 10048,259

48,259% of 1,000482,590

As a fraction of 10048,259/100

Read another way

As seconds13 hours, 24 minutes and 19 seconds

As bytes47.128 KiB

As a 24-bit colour#00BC83

Keep nerding

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