Nerdulator> put something in

Recognised as Number

27,320

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value27,320
Digit count5
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 5 × 683
Distinct prime factors32, 5, 683
Number of divisors16
Sum of divisors σ(n)61,560
Aliquot sum34,240sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)10,912integers below n that share no factor with it
Carmichael function λ(n)1,364the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,912
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 20, 40, 683, 1,366, 2,732, 3,415, 5,464, 6,830, 13,660, 27,32016 in total

Arithmetic

Previous number27,319
Next number27,321
Double54,640
Half13,660
Square root165.287628091≈irrational, shown to 9 decimal places
Cube root30.118053356≈
Negation-27,320
Reciprocal0.0000366032≈

Representations

Decimal27,320
Binary11010101011100015 bits
Octal65270
Hexadecimal6AB8
Base 36L2W
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-seven thousand, three hundred and twenty
Ordinaltwenty-seven thousand, three hundred and twentieth
Scientific notation2.732 × 10^4
Engineering notation27.32 × 10^3

In other bases

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

Bit-level

0110101010111000
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 33 trailing zeros
Power of twoNo
Bytes26a b8
Gray code101111111100100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110101010111000
32-bit00000000000000000110101010111000
64-bit0000000000000000000000000000000000000000000000000110101010111000
One's complement1001010101000111at 16 bits, every bit flipped
Bits reversed0001110101010110at 16 bits
Rotated left by 11101010101110000at 16 bits, wrapping
Shifted left by 11101010101110000= 54,640, no wrap
Shifted right by 111010101011100= 13,660, discarding the low bit
These bits as a double1.34978734 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime27,329+9
Previous prime27,299−21
Distance to nearest prime9
Nearest square below27,225
Nearest square above27,556

Powers & multiples

27,320 to the power 2746,382,400
27,320 to the power 320,391,167,168,000
27,320 to the power 4557,086,687,029,760,000
27,320 to the power 515,219,608,289,653,043,200,000
First ten multiples27,320, 54,640, 81,960, 109,280, 136,600, 163,920, 191,240, 218,560, 245,880, 273,200
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 5
Divisible by 10Yes
Divisible by 11No, remainder 7
Divisible by 12No, remainder 8
Divisible by 100No, remainder 20

Collatz (3n + 1) trajectory

Steps to reach 1152the total stopping time
Highest value reached27,320
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps27,320 → 13,660 → 6,830 → 3,415 → 10,246 → 5,123 → 15,370 → 7,685 → 23,056 → 11,528 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,732,000%
27,320% as a decimal273.2
27,320% of 10027,320
27,320% of 1,000273,200
As a fraction of 10027,320/100

Read another way

As bytes26.68 KiB
As a 24-bit colour#006AB8

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 “27320” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.