Recognised as Number

28,039

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value28,039

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 2,549

Distinct prime factors211, 2,549

Number of divisors4

Sum of divisors σ(n)30,600

Aliquot sum2,561sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)12,740the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,480

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 2,549, 28,0394 in total

Arithmetic

Previous number28,038

Next number28,040

Double56,078

Half14,019.5

Square786,185,521

Cube22,043,855,823,319

Square root167.448499545≈irrational, shown to 9 decimal places

Cube root30.379981627≈

Negation-28,039

Reciprocal0.0000356646≈

Representations

Decimal28,039

Binary11011011000011115 bits

Octal66607

Hexadecimal6D87

Base 36LMV

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

In wordstwenty-eight thousand and thirty-nine

Ordinaltwenty-eight thousand and thirty-ninth

Scientific notation2.8039 × 10^4

Engineering notation28.039 × 10^3

In other bases

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

Quinary1344124base 5; one hand: 7 digits

Septenary144514base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110110110000111

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes26d 87

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

At each machine width

16-bit0110110110000111

32-bit00000000000000000110110110000111

64-bit0000000000000000000000000000000000000000000000000110110110000111

One's complement1001001001111000at 16 bits, every bit flipped

Bits reversed1110000110110110at 16 bits

Rotated left by 11101101100001110at 16 bits, wrapping

Shifted left by 11101101100001110= 56,078, no wrap

Shifted right by 111011011000011= 14,019, discarding the low bit

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

Nearest landmarks

Next prime28,051+12

Previous prime28,031−8

Distance to nearest prime8

Nearest square below27,889

Nearest square above28,224

Powers & multiples

28,039 to the power 2786,185,521

28,039 to the power 322,043,855,823,319

28,039 to the power 4618,087,673,430,041,441

28,039 to the power 517,330,560,275,304,931,964,199

First ten multiples28,039, 56,078, 84,117, 112,156, 140,195, 168,234, 196,273, 224,312, 252,351, 280,390

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

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 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 7

Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 133the total stopping time

Highest value reached189,2686× the starting value

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

First steps28,039 → 84,118 → 42,059 → 126,178 → 63,089 → 189,268 → 94,634 → 47,317 → 141,952 → 70,976 → …

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

As a percentage & fraction

As a percentage2,803,900%

28,039% as a decimal280.39

28,039% of 10028,039

28,039% of 1,000280,390

As a fraction of 10028,039/100

Read another way

As seconds7 hours, 47 minutes and 19 seconds

As bytes27.382 KiB

As a 24-bit colour#006D87

Keep nerding

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