Nerdulator> put something in

Recognised as Number

27,317

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value27,317
Digit count5
Digit sum20
Digit product294
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation59 × 463
Distinct prime factors259, 463
Number of divisors4
Sum of divisors σ(n)27,840
Aliquot sum523sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)26,796integers below n that share no factor with it
Carmichael function λ(n)13,398the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 26,796
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 59, 463, 27,3174 in total

Arithmetic

Previous number27,316
Next number27,318
Double54,634
Square root165.278552753≈irrational, shown to 9 decimal places
Cube root30.116950898≈
Negation-27,317
Reciprocal0.0000366072≈

Representations

Decimal27,317
Binary11010101011010115 bits
Octal65265
Hexadecimal6AB5
Base 36L2T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-seven thousand, three hundred and seventeen
Ordinaltwenty-seven thousand, three hundred and seventeenth
Scientific notation2.7317 × 10^4
Engineering notation27.317 × 10^3

In other bases

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

Bit-level

0110101010110101
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
Bytes26a b5
Gray code101111111101111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110101010110101
32-bit00000000000000000110101010110101
64-bit0000000000000000000000000000000000000000000000000110101010110101
One's complement1001010101001010at 16 bits, every bit flipped
Bits reversed1010110101010110at 16 bits
Rotated left by 11101010101101010at 16 bits, wrapping
Shifted left by 11101010101101010= 54,634, no wrap
Shifted right by 111010101011010= 13,658, discarding the low bit
These bits as a double1.34963912 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime27,329+12
Previous prime27,299−18
Distance to nearest prime12
Nearest square below27,225
Nearest square above27,556

Powers & multiples

27,317 to the power 2746,218,489
27,317 to the power 320,384,450,464,013
27,317 to the power 4556,842,033,325,443,121
27,317 to the power 515,211,253,824,351,129,736,357
First ten multiples27,317, 54,634, 81,951, 109,268, 136,585, 163,902, 191,219, 218,536, 245,853, 273,170
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1152the total stopping time
Highest value reached81,9523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps27,317 → 81,952 → 40,976 → 20,488 → 10,244 → 5,122 → 2,561 → 7,684 → 3,842 → 1,921 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,731,700%
27,317% as a decimal273.17
27,317% of 10027,317
27,317% of 1,000273,170
As a fraction of 10027,317/100

Read another way

As bytes26.677 KiB
As a 24-bit colour#006AB5

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