Recognised as Number

27,637

Positive
Odd
Composite
5 digits

27,637 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value27,637

Digit count5

Digit sum25

Digit product1,764

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation29 × 953

Distinct prime factors229, 953

Number of divisors4

Sum of divisors σ(n)28,620

Aliquot sum983sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)952the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 26,656

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

SquarefreeYesno repeated prime factor

All divisors1, 29, 953, 27,6374 in total

Arithmetic

Previous number27,636

Next number27,638

Double55,274

Half13,818.5

Square763,803,769

Cube21,109,244,763,853

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

Cube root30.2340945≈

Negation-27,637

Reciprocal0.0000361834≈

Representations

Decimal27,637

Binary11010111111010115 bits

Octal65765

Hexadecimal6BF5

Base 36LBP

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

In wordstwenty-seven thousand, six hundred and thirty-seven

Ordinaltwenty-seven thousand, six hundred and thirty-seventh

Scientific notation2.7637 × 10^4

Engineering notation27.637 × 10^3

In other bases

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

Quinary1341022base 5; one hand: 7 digits

Septenary143401base 7: 6 digits

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

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

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

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

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

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

Bit-level

0110101111110101

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 f5

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

At each machine width

16-bit0110101111110101

32-bit00000000000000000110101111110101

64-bit0000000000000000000000000000000000000000000000000110101111110101

One's complement1001010000001010at 16 bits, every bit flipped

Bits reversed1010111111010110at 16 bits

Rotated left by 11101011111101010at 16 bits, wrapping

Shifted left by 11101011111101010= 55,274, no wrap

Shifted right by 111010111111010= 13,818, discarding the low bit

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

Nearest landmarks

Next prime27,647+10

Previous prime27,631−6

Distance to nearest prime6

Nearest square below27,556

Nearest square above27,889

Powers & multiples

27,637 to the power 2763,803,769

27,637 to the power 321,109,244,763,853

27,637 to the power 4583,396,197,538,605,361

27,637 to the power 516,123,320,711,374,436,361,957

First ten multiples27,637, 55,274, 82,911, 110,548, 138,185, 165,822, 193,459, 221,096, 248,733, 276,370

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached82,9123× the starting value

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

First steps27,637 → 82,912 → 41,456 → 20,728 → 10,364 → 5,182 → 2,591 → 7,774 → 3,887 → 11,662 → …

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

As a percentage & fraction

As a percentage2,763,700%

27,637% as a decimal276.37

27,637% of 10027,637

27,637% of 1,000276,370

As a fraction of 10027,637/100

Read another way

As seconds7 hours, 40 minutes and 37 seconds

As bytes26.989 KiB

As a 24-bit colour#006BF5

Keep nerding

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