Recognised as Number

28,159

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value28,159

Digit count5

Digit sum25

Digit product720

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation29 × 971

Distinct prime factors229, 971

Number of divisors4

Sum of divisors σ(n)29,160

Aliquot sum1,001sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)13,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,160

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

SquarefreeYesno repeated prime factor

All divisors1, 29, 971, 28,1594 in total

Arithmetic

Previous number28,158

Next number28,160

Double56,318

Half14,079.5

Square792,929,281

Cube22,328,095,623,679

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

Cube root30.423259554≈

Negation-28,159

Reciprocal0.0000355126≈

Representations

Decimal28,159

Binary11011011111111115 bits

Octal66777

Hexadecimal6DFF

Base 36LQ7

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

In wordstwenty-eight thousand, one hundred and fifty-nine

Ordinaltwenty-eight thousand, one hundred and fifty-ninth

Scientific notation2.8159 × 10^4

Engineering notation28.159 × 10^3

In other bases

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

Quinary1400114base 5; one hand: 7 digits

Septenary145045base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110110111111111

Bit length15 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits2within that length

Bit parityodd13 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 ff

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

At each machine width

16-bit0110110111111111

32-bit00000000000000000110110111111111

64-bit0000000000000000000000000000000000000000000000000110110111111111

One's complement1001001000000000at 16 bits, every bit flipped

Bits reversed1111111110110110at 16 bits

Rotated left by 11101101111111110at 16 bits, wrapping

Shifted left by 11101101111111110= 56,318, no wrap

Shifted right by 111011011111111= 14,079, discarding the low bit

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

Nearest landmarks

Next prime28,163+4

Previous prime28,151−8

Distance to nearest prime4

Nearest square below27,889

Nearest square above28,224

Powers & multiples

28,159 to the power 2792,929,281

28,159 to the power 322,328,095,623,679

28,159 to the power 4628,736,844,667,176,961

28,159 to the power 517,704,600,808,983,036,044,799

First ten multiples28,159, 56,318, 84,477, 112,636, 140,795, 168,954, 197,113, 225,272, 253,431, 281,590

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 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 7

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 182the total stopping time

Highest value reached2,165,12876× the starting value

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

First steps28,159 → 84,478 → 42,239 → 126,718 → 63,359 → 190,078 → 95,039 → 285,118 → 142,559 → 427,678 → …

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

As a percentage & fraction

As a percentage2,815,900%

28,159% as a decimal281.59

28,159% of 10028,159

28,159% of 1,000281,590

As a fraction of 10028,159/100

Read another way

As seconds7 hours, 49 minutes and 19 seconds

As bytes27.499 KiB

As a 24-bit colour#006DFF

Keep nerding

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