Recognised as Number

27,281

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value27,281

Digit count5

Digit sum20

Digit product224

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation27,281

Distinct prime factors127,281

Number of divisors2

Sum of divisors σ(n)27,282

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number27,280

Next number27,282

Double54,562

Half13,640.5

Square744,252,961

Cube20,303,965,029,041

Square root165.169609796≈irrational, shown to 9 decimal places

Cube root30.1037151≈

Negation-27,281

Reciprocal0.0000366555≈

Representations

Decimal27,281

Binary11010101001000115 bits

Octal65221

Hexadecimal6A91

Base 36L1T

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

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

Ordinaltwenty-seven thousand, two hundred and eighty-first

Scientific notation2.7281 × 10^4

Engineering notation27.281 × 10^3

In other bases

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

Quinary1333111base 5; one hand: 7 digits

Septenary142352base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101010010001

Bit length15 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits8within that length

Bit parityodd7 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

Bytes26a 91

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

At each machine width

16-bit0110101010010001

32-bit00000000000000000110101010010001

64-bit0000000000000000000000000000000000000000000000000110101010010001

One's complement1001010101101110at 16 bits, every bit flipped

Bits reversed1000100101010110at 16 bits

Rotated left by 11101010100100010at 16 bits, wrapping

Shifted left by 11101010100100010= 54,562, no wrap

Shifted right by 111010101001000= 13,640, discarding the low bit

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

Nearest landmarks

Next prime27,283+2

Previous prime27,277−4

Distance to nearest prime0, it is prime

Nearest square below27,225

Nearest square above27,556

Powers & multiples

27,281 to the power 2744,252,961

27,281 to the power 320,303,965,029,041

27,281 to the power 4553,912,469,957,267,521

27,281 to the power 515,111,286,092,904,215,240,401

First ten multiples27,281, 54,562, 81,843, 109,124, 136,405, 163,686, 190,967, 218,248, 245,529, 272,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 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 164the total stopping time

Highest value reached81,8443× the starting value

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

First steps27,281 → 81,844 → 40,922 → 20,461 → 61,384 → 30,692 → 15,346 → 7,673 → 23,020 → 11,510 → …

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

As a percentage & fraction

As a percentage2,728,100%

27,281% as a decimal272.81

27,281% of 10027,281

27,281% of 1,000272,810

As a fraction of 10027,281/100

Read another way

As seconds7 hours, 34 minutes and 41 seconds

As bytes26.642 KiB

As a 24-bit colour#006A91

Keep nerding

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