Recognised as Number

28,664

Positive
Even
Composite
5 digits

28,664 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value28,664

Digit count5

Digit sum26

Digit product2,304

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 3,583

Distinct prime factors22, 3,583

Number of divisors8

Sum of divisors σ(n)53,760

Aliquot sum25,096sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)3,582the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,328

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 3,583, 7,166, 14,332, 28,6648 in total

Arithmetic

Previous number28,663

Next number28,665

Double57,328

Half14,332

Square821,624,896

Cube23,551,056,018,944

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

Cube root30.604052036≈

Negation-28,664

Reciprocal0.000034887≈

Representations

Decimal28,664

Binary11011111111100015 bits

Octal67770

Hexadecimal6FF8

Base 36M48

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

In wordstwenty-eight thousand, six hundred and sixty-four

Ordinaltwenty-eight thousand, six hundred and sixty-fourth

Scientific notation2.8664 × 10^4

Engineering notation28.664 × 10^3

In other bases

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

Quinary1404124base 5; one hand: 7 digits

Septenary146366base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110111111111000

Bit length15 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits4within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes26f f8

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

At each machine width

16-bit0110111111111000

32-bit00000000000000000110111111111000

64-bit0000000000000000000000000000000000000000000000000110111111111000

One's complement1001000000000111at 16 bits, every bit flipped

Bits reversed0001111111110110at 16 bits

Rotated left by 11101111111110000at 16 bits, wrapping

Shifted left by 11101111111110000= 57,328, no wrap

Shifted right by 111011111111100= 14,332, discarding the low bit

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

Nearest landmarks

Next prime28,669+5

Previous prime28,663−1

Distance to nearest prime1

Nearest square below28,561

Nearest square above28,900

Powers & multiples

28,664 to the power 2821,624,896

28,664 to the power 323,551,056,018,944

28,664 to the power 4675,067,469,727,010,816

28,664 to the power 519,350,133,952,255,038,029,824

First ten multiples28,664, 57,328, 85,992, 114,656, 143,320, 171,984, 200,648, 229,312, 257,976, 286,640

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 2

Divisible by 7No, remainder 6

Divisible by 8Yes

Divisible by 9No, remainder 8

Divisible by 10No, remainder 4

Divisible by 11No, remainder 9

Divisible by 12No, remainder 8

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time

Highest value reached275,5609× the starting value

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

First steps28,664 → 14,332 → 7,166 → 3,583 → 10,750 → 5,375 → 16,126 → 8,063 → 24,190 → 12,095 → …

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

As a percentage & fraction

As a percentage2,866,400%

28,664% as a decimal286.64

28,664% of 10028,664

28,664% of 1,000286,640

As a fraction of 10028,664/100

Read another way

As seconds7 hours, 57 minutes and 44 seconds

As bytes27.992 KiB

As a 24-bit colour#006FF8

Keep nerding

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