Recognised as Number

27,555

Positive
Odd
Composite
5 digits

27,555 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value27,555

Digit count5

Digit sum24

Digit product1,750

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 11 × 167

Distinct prime factors43, 5, 11, 167

Number of divisors16

Sum of divisors σ(n)48,384

Aliquot sum20,829sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 11, 15, 33, 55, 165, 167, 501, 835, 1,837, 2,505, 5,511, 9,185, 27,55516 in total

Arithmetic

Previous number27,554

Next number27,556

Double55,110

Half13,777.5

Square759,278,025

Cube20,921,905,978,875

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

Cube root30.204162986≈

Negation-27,555

Reciprocal0.0000362911≈

Representations

Decimal27,555

Binary11010111010001115 bits

Octal65643

Hexadecimal6BA3

Base 36L9F

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

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

Ordinaltwenty-seven thousand, five hundred and fifty-fifth

Scientific notation2.7555 × 10^4

Engineering notation27.555 × 10^3

In other bases

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

Quinary1340210base 5; one hand: 7 digits

Septenary143223base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101110100011

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

Bit parityodd9 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 a3

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

At each machine width

16-bit0110101110100011

32-bit00000000000000000110101110100011

64-bit0000000000000000000000000000000000000000000000000110101110100011

One's complement1001010001011100at 16 bits, every bit flipped

Bits reversed1100010111010110at 16 bits

Rotated left by 11101011101000110at 16 bits, wrapping

Shifted left by 11101011101000110= 55,110, no wrap

Shifted right by 111010111010001= 13,777, discarding the low bit

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

Nearest landmarks

Next prime27,581+26

Previous prime27,551−4

Distance to nearest prime4

Nearest square below27,225

Nearest square above27,556

Powers & multiples

27,555 to the power 2759,278,025

27,555 to the power 320,921,905,978,875

27,555 to the power 4576,503,119,247,900,625

27,555 to the power 515,885,543,450,875,901,721,875

First ten multiples27,555, 55,110, 82,665, 110,220, 137,775, 165,330, 192,885, 220,440, 247,995, 275,550

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 55

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached124,0004× the starting value

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

First steps27,555 → 82,666 → 41,333 → 124,000 → 62,000 → 31,000 → 15,500 → 7,750 → 3,875 → 11,626 → …

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

As a percentage & fraction

As a percentage2,755,500%

27,555% as a decimal275.55

27,555% of 10027,555

27,555% of 1,000275,550

As a fraction of 10027,555/100

Read another way

As seconds7 hours, 39 minutes and 15 seconds

As bytes26.909 KiB

As a 24-bit colour#006BA3

Keep nerding

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