Recognised as Number

27,556

Positive
Even
Composite
Perfect square
5 digits

27,556 is an even 5-digit integer and a composite number. It has 9 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value27,556

Digit count5

Digit sum25

Digit product2,100

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 166²

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 83^2

Distinct prime factors22, 83

Number of divisors9

Sum of divisors σ(n)48,811

Aliquot sum21,255sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 83, 166, 332, 6,889, 13,778, 27,5569 in total

Arithmetic

Previous number27,555

Next number27,557

Double55,112

Half13,778

Square759,333,136

Cube20,924,183,895,616

Square root166exact

Cube root30.204528362≈

Negation-27,556

Reciprocal0.0000362897≈

Representations

Decimal27,556

Binary11010111010010015 bits

Octal65644

Hexadecimal6BA4

Base 36L9G

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

In wordstwenty-seven thousand, five hundred and fifty-six

Ordinaltwenty-seven thousand, five hundred and fifty-sixth

Scientific notation2.7556 × 10^4

Engineering notation27.556 × 10^3

In other bases

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

Quinary1340211base 5; one hand: 7 digits

Septenary143224base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101110100100

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 even

Highest set bitbit 14worth 16,384

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes26b a4

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

At each machine width

16-bit0110101110100100

32-bit00000000000000000110101110100100

64-bit0000000000000000000000000000000000000000000000000110101110100100

One's complement1001010001011011at 16 bits, every bit flipped

Bits reversed0010010111010110at 16 bits

Rotated left by 11101011101001000at 16 bits, wrapping

Shifted left by 11101011101001000= 55,112, no wrap

Shifted right by 111010111010010= 13,778, discarding the low bit

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

Nearest landmarks

Next prime27,581+25

Previous prime27,551−5

Distance to nearest prime5

Nearest square below27,556

Nearest square above27,889

Powers & multiples

27,556 to the power 2759,333,136

27,556 to the power 320,924,183,895,616

27,556 to the power 4576,586,811,427,594,496

27,556 to the power 515,888,426,175,698,793,931,776

First ten multiples27,556, 55,112, 82,668, 110,224, 137,780, 165,336, 192,892, 220,448, 248,004, 275,560

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 1

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 4

Divisible by 9No, remainder 7

Divisible by 10No, remainder 6

Divisible by 11No, remainder 1

Divisible by 12No, remainder 4

Divisible by 100No, remainder 56

Collatz (3n + 1) trajectory

Steps to reach 1183the total stopping time

Highest value reached55,8882× the starting value

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

First steps27,556 → 13,778 → 6,889 → 20,668 → 10,334 → 5,167 → 15,502 → 7,751 → 23,254 → 11,627 → …

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

As a percentage & fraction

As a percentage2,755,600%

27,556% as a decimal275.56

27,556% of 10027,556

27,556% of 1,000275,560

As a fraction of 10027,556/100

Read another way

As seconds7 hours, 39 minutes and 16 seconds

As bytes26.91 KiB

As a 24-bit colour#006BA4

Keep nerding

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