Nerdulator> put something in

Recognised as Number

27,322

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value27,322
Digit count5
Digit sum16
Digit product168
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 19 × 719
Distinct prime factors32, 19, 719
Number of divisors8
Sum of divisors σ(n)43,200
Aliquot sum15,878sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,924integers below n that share no factor with it
Carmichael function λ(n)6,462the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,924
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 19, 38, 719, 1,438, 13,661, 27,3228 in total

Arithmetic

Previous number27,321
Next number27,323
Double54,644
Half13,661
Square root165.29367804≈irrational, shown to 9 decimal places
Cube root30.118788283≈
Negation-27,322
Reciprocal0.0000366005≈

Representations

Decimal27,322
Binary11010101011101015 bits
Octal65272
Hexadecimal6ABA
Base 36L2Y
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-seven thousand, three hundred and twenty-two
Ordinaltwenty-seven thousand, three hundred and twenty-second
Scientific notation2.7322 × 10^4
Engineering notation27.322 × 10^3

In other bases

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

Bit-level

0110101010111010
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 even
Highest set bitbit 14worth 16,384
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes26a ba
Gray code101111111100111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110101010111010
32-bit00000000000000000110101010111010
64-bit0000000000000000000000000000000000000000000000000110101010111010
One's complement1001010101000101at 16 bits, every bit flipped
Bits reversed0101110101010110at 16 bits
Rotated left by 11101010101110100at 16 bits, wrapping
Shifted left by 11101010101110100= 54,644, no wrap
Shifted right by 111010101011101= 13,661, discarding the low bit
These bits as a double1.34988616 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime27,329+7
Previous prime27,299−23
Distance to nearest prime7
Nearest square below27,225
Nearest square above27,556

Powers & multiples

27,322 to the power 2746,491,684
27,322 to the power 320,395,645,790,248
27,322 to the power 4557,249,834,281,155,856
27,322 to the power 515,225,179,972,229,740,297,632
First ten multiples27,322, 54,644, 81,966, 109,288, 136,610, 163,932, 191,254, 218,576, 245,898, 273,220
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1152the total stopping time
Highest value reached40,9841× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps27,322 → 13,661 → 40,984 → 20,492 → 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,200%
27,322% as a decimal273.22
27,322% of 10027,322
27,322% of 1,000273,220
As a fraction of 10027,322/100

Read another way

As bytes26.682 KiB
As a 24-bit colour#006ABA

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