Nerdulator> put something in

Recognised as Number

27,327

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value27,327
Digit count5
Digit sum21
Digit product588
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 9,109
Distinct prime factors23, 9,109
Number of divisors4
Sum of divisors σ(n)36,440
Aliquot sum9,113sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)18,216integers below n that share no factor with it
Carmichael function λ(n)9,108the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,216
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 9,109, 27,3274 in total

Arithmetic

Previous number27,326
Next number27,328
Double54,654
Square root165.308801944≈irrational, shown to 9 decimal places
Cube root30.120625444≈
Negation-27,327
Reciprocal0.0000365938≈

Representations

Decimal27,327
Binary11010101011111115 bits
Octal65277
Hexadecimal6ABF
Base 36L33
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-seven thousand, three hundred and twenty-seven
Ordinaltwenty-seven thousand, three hundred and twenty-seventh
Scientific notation2.7327 × 10^4
Engineering notation27.327 × 10^3

In other bases

Ternary1101111010base 3; the most digit-efficient integer base after e: 10 digits
Quinary1333302base 5; one hand: 7 digits
Septenary142446base 7: 6 digits
Nonary41433base 9; each digit is two ternary digits: 5 digits
Duodecimal13993base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3867base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:35:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1101111010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011111111000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0110101010111111
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
Bytes26a bf
Gray code101111111100000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110101010111111
32-bit00000000000000000110101010111111
64-bit0000000000000000000000000000000000000000000000000110101010111111
One's complement1001010101000000at 16 bits, every bit flipped
Bits reversed1111110101010110at 16 bits
Rotated left by 11101010101111110at 16 bits, wrapping
Shifted left by 11101010101111110= 54,654, no wrap
Shifted right by 111010101011111= 13,663, discarding the low bit
These bits as a double1.35013319 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime27,329+2
Previous prime27,299−28
Distance to nearest prime2
Nearest square below27,225
Nearest square above27,556

Powers & multiples

27,327 to the power 2746,764,929
27,327 to the power 320,406,845,214,783
27,327 to the power 4557,657,859,184,375,041
27,327 to the power 515,239,116,317,931,416,745,407
First ten multiples27,327, 54,654, 81,981, 109,308, 136,635, 163,962, 191,289, 218,616, 245,943, 273,270
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 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1170the total stopping time
Highest value reached3,786,424138× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps27,327 → 81,982 → 40,991 → 122,974 → 61,487 → 184,462 → 92,231 → 276,694 → 138,347 → 415,042 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,732,700%
27,327% as a decimal273.27
27,327% of 10027,327
27,327% of 1,000273,270
As a fraction of 10027,327/100

Read another way

As bytes26.687 KiB
As a 24-bit colour#006ABF

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “27327” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.