Recognised as Number

27,211

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value27,211

Digit count5

Digit sum13

Digit product28

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation27,211

Distinct prime factors127,211

Number of divisors2

Sum of divisors σ(n)27,212

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number27,210

Next number27,212

Double54,422

Half13,605.5

Square740,438,521

Cube20,148,072,594,931

Square root164.957570302≈irrational, shown to 9 decimal places

Cube root30.077945456≈

Negation-27,211

Reciprocal0.0000367498≈

Representations

Decimal27,211

Binary11010100100101115 bits

Octal65113

Hexadecimal6A4B

Base 36KZV

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

In wordstwenty-seven thousand, two hundred and eleven

Ordinaltwenty-seven thousand, two hundred and eleventh

Scientific notation2.7211 × 10^4

Engineering notation27.211 × 10^3

In other bases

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

Quinary1332321base 5; one hand: 7 digits

Septenary142222base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101001001011

Bit length15 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits7within that length

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

Bytes26a 4b

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

At each machine width

16-bit0110101001001011

32-bit00000000000000000110101001001011

64-bit0000000000000000000000000000000000000000000000000110101001001011

One's complement1001010110110100at 16 bits, every bit flipped

Bits reversed1101001001010110at 16 bits

Rotated left by 11101010010010110at 16 bits, wrapping

Shifted left by 11101010010010110= 54,422, no wrap

Shifted right by 111010100100101= 13,605, discarding the low bit

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

Nearest landmarks

Next prime27,239+28

Previous prime27,197−14

Distance to nearest prime0, it is prime

Nearest square below26,896

Nearest square above27,225

Powers & multiples

27,211 to the power 2740,438,521

27,211 to the power 320,148,072,594,931

27,211 to the power 4548,249,203,380,667,441

27,211 to the power 514,918,409,073,191,341,737,051

First ten multiples27,211, 54,422, 81,633, 108,844, 136,055, 163,266, 190,477, 217,688, 244,899, 272,110

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 7

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time

Highest value reached122,4524× the starting value

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

First steps27,211 → 81,634 → 40,817 → 122,452 → 61,226 → 30,613 → 91,840 → 45,920 → 22,960 → 11,480 → …

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

As a percentage & fraction

As a percentage2,721,100%

27,211% as a decimal272.11

27,211% of 10027,211

27,211% of 1,000272,110

As a fraction of 10027,211/100

Read another way

As seconds7 hours, 33 minutes and 31 seconds

As bytes26.573 KiB

As a 24-bit colour#006A4B

Keep nerding

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