Nerdulator> put something in

Recognised as Number

27,315

  • Positive
  • Odd
  • Composite
  • 5 digits

27,315 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value27,315
Digit count5
Digit sum18
Digit product210
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5 × 607
Distinct prime factors33, 5, 607
Number of divisors12
Sum of divisors σ(n)47,424
Aliquot sum20,109sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)14,544integers below n that share no factor with it
Carmichael function λ(n)1,212the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,544
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 45, 607, 1,821, 3,035, 5,463, 9,105, 27,31512 in total

Arithmetic

Previous number27,314
Next number27,316
Double54,630
Square root165.27250225≈irrational, shown to 9 decimal places
Cube root30.116215881≈
Negation-27,315
Reciprocal0.0000366099≈

Representations

Decimal27,315
Binary11010101011001115 bits
Octal65263
Hexadecimal6AB3
Base 36L2R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-seven thousand, three hundred and fifteen
Ordinaltwenty-seven thousand, three hundred and fifteenth
Scientific notation2.7315 × 10^4
Engineering notation27.315 × 10^3

In other bases

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

Bit-level

0110101010110011
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 b3
Gray code101111111101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110101010110011
32-bit00000000000000000110101010110011
64-bit0000000000000000000000000000000000000000000000000110101010110011
One's complement1001010101001100at 16 bits, every bit flipped
Bits reversed1100110101010110at 16 bits
Rotated left by 11101010101100110at 16 bits, wrapping
Shifted left by 11101010101100110= 54,630, no wrap
Shifted right by 111010101011001= 13,657, discarding the low bit
These bits as a double1.34954031 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime27,329+14
Previous prime27,299−16
Distance to nearest prime14
Nearest square below27,225
Nearest square above27,556

Powers & multiples

27,315 to the power 2746,109,225
27,315 to the power 320,379,973,480,875
27,315 to the power 4556,678,975,630,100,625
27,315 to the power 515,205,686,219,336,198,571,875
First ten multiples27,315, 54,630, 81,945, 109,260, 136,575, 163,890, 191,205, 218,520, 245,835, 273,150
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 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 146the total stopping time
Highest value reached122,9204× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps27,315 → 81,946 → 40,973 → 122,920 → 61,460 → 30,730 → 15,365 → 46,096 → 23,048 → 11,524 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,731,500%
27,315% as a decimal273.15
27,315% of 10027,315
27,315% of 1,000273,150
As a fraction of 10027,315/100

Read another way

As bytes26.675 KiB
As a 24-bit colour#006AB3

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