Recognised as Number

27,581

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value27,581

Digit count5

Digit sum23

Digit product560

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation27,581

Distinct prime factors127,581

Number of divisors2

Sum of divisors σ(n)27,582

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)27,580the 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, 27,5812 in total

Arithmetic

Previous number27,580

Next number27,582

Double55,162

Half13,790.5

Square760,711,561

Cube20,981,185,563,941

Square root166.075284133≈irrational, shown to 9 decimal places

Cube root30.213659888≈

Negation-27,581

Reciprocal0.0000362568≈

Representations

Decimal27,581

Binary11010111011110115 bits

Octal65675

Hexadecimal6BBD

Base 36LA5

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

In wordstwenty-seven thousand, five hundred and eighty-one

Ordinaltwenty-seven thousand, five hundred and eighty-first

Scientific notation2.7581 × 10^4

Engineering notation27.581 × 10^3

In other bases

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

Quinary1340311base 5; one hand: 7 digits

Septenary143261base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101110111101

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 odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes26b bd

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

At each machine width

16-bit0110101110111101

32-bit00000000000000000110101110111101

64-bit0000000000000000000000000000000000000000000000000110101110111101

One's complement1001010001000010at 16 bits, every bit flipped

Bits reversed1011110111010110at 16 bits

Rotated left by 11101011101111010at 16 bits, wrapping

Shifted left by 11101011101111010= 55,162, no wrap

Shifted right by 111010111011110= 13,790, discarding the low bit

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

Nearest landmarks

Next prime27,583+2

Previous prime27,551−30

Distance to nearest prime0, it is prime

Nearest square below27,556

Nearest square above27,889

Powers & multiples

27,581 to the power 2760,711,561

27,581 to the power 320,981,185,563,941

27,581 to the power 4578,682,079,039,056,721

27,581 to the power 515,960,630,421,976,223,421,901

First ten multiples27,581, 55,162, 82,743, 110,324, 137,905, 165,486, 193,067, 220,648, 248,229, 275,810

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 5

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time

Highest value reached176,7406× the starting value

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

First steps27,581 → 82,744 → 41,372 → 20,686 → 10,343 → 31,030 → 15,515 → 46,546 → 23,273 → 69,820 → …

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

As a percentage & fraction

As a percentage2,758,100%

27,581% as a decimal275.81

27,581% of 10027,581

27,581% of 1,000275,810

As a fraction of 10027,581/100

Read another way

As seconds7 hours, 39 minutes and 41 seconds

As bytes26.935 KiB

As a 24-bit colour#006BBD

Keep nerding

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