Recognised as Number

28,585

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value28,585

Digit count5

Digit sum28

Digit product3,200

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 5,717

Distinct prime factors25, 5,717

Number of divisors4

Sum of divisors σ(n)34,308

Aliquot sum5,723sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 5,717, 28,5854 in total

Arithmetic

Previous number28,584

Next number28,586

Double57,170

Half14,292.5

Square817,102,225

Cube23,356,867,101,625

Square root169.070991007≈irrational, shown to 9 decimal places

Cube root30.575910527≈

Negation-28,585

Reciprocal0.0000349834≈

Representations

Decimal28,585

Binary11011111010100115 bits

Octal67651

Hexadecimal6FA9

Base 36M21

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

In wordstwenty-eight thousand, five hundred and eighty-five

Ordinaltwenty-eight thousand, five hundred and eighty-fifth

Scientific notation2.8585 × 10^4

Engineering notation28.585 × 10^3

In other bases

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

Quinary1403320base 5; one hand: 7 digits

Septenary146224base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110111110101001

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes26f a9

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

At each machine width

16-bit0110111110101001

32-bit00000000000000000110111110101001

64-bit0000000000000000000000000000000000000000000000000110111110101001

One's complement1001000001010110at 16 bits, every bit flipped

Bits reversed1001010111110110at 16 bits

Rotated left by 11101111101010010at 16 bits, wrapping

Shifted left by 11101111101010010= 57,170, no wrap

Shifted right by 111011111010100= 14,292, discarding the low bit

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

Nearest landmarks

Next prime28,591+6

Previous prime28,579−6

Distance to nearest prime6

Nearest square below28,561

Nearest square above28,900

Powers & multiples

28,585 to the power 2817,102,225

28,585 to the power 323,356,867,101,625

28,585 to the power 4667,656,046,099,950,625

28,585 to the power 519,084,948,077,767,088,615,625

First ten multiples28,585, 57,170, 85,755, 114,340, 142,925, 171,510, 200,095, 228,680, 257,265, 285,850

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 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 85

Collatz (3n + 1) trajectory

Steps to reach 177the total stopping time

Highest value reached1,564,75654× the starting value

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

First steps28,585 → 85,756 → 42,878 → 21,439 → 64,318 → 32,159 → 96,478 → 48,239 → 144,718 → 72,359 → …

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

As a percentage & fraction

As a percentage2,858,500%

28,585% as a decimal285.85

28,585% of 10028,585

28,585% of 1,000285,850

As a fraction of 10028,585/100

Read another way

As seconds7 hours, 56 minutes and 25 seconds

As bytes27.915 KiB

As a 24-bit colour#006FA9

Keep nerding

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