Recognised as Number

27,197

Positive
Odd
Prime
5 digits

27,197 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value27,197

Digit count5

Digit sum26

Digit product882

Multiplicative persistence4times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation27,197

Distinct prime factors127,197

Number of divisors2

Sum of divisors σ(n)27,198

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)27,196integers below n that share no factor with it

Carmichael function λ(n)27,196the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 27,1972 in total

Arithmetic

Previous number27,196

Next number27,198

Double54,394

Half13,598.5

Square739,676,809

Cube20,116,990,174,373

Square root164.915129688≈irrational, shown to 9 decimal places

Cube root30.072786226≈

Negation-27,197

Reciprocal0.0000367688≈

Representations

Decimal27,197

Binary11010100011110115 bits

Octal65075

Hexadecimal6A3D

Base 36KZH

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordstwenty-seven thousand, one hundred and ninety-seven

Ordinaltwenty-seven thousand, one hundred and ninety-seventh

Scientific notation2.7197 × 10^4

Engineering notation27.197 × 10^3

In other bases

Ternary1101022022base 3; the most digit-efficient integer base after e: 10 digits

Quinary1332242base 5; one hand: 7 digits

Septenary142202base 7: 6 digits

Nonary41268base 9; each digit is two ternary digits: 5 digits

Duodecimal138a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal37jhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal7:33:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary110110T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11011111001001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0110101000111101

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 3d

Gray code101111100100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0110101000111101

32-bit00000000000000000110101000111101

64-bit0000000000000000000000000000000000000000000000000110101000111101

One's complement1001010111000010at 16 bits, every bit flipped

Bits reversed1011110001010110at 16 bits

Rotated left by 11101010001111010at 16 bits, wrapping

Shifted left by 11101010001111010= 54,394, no wrap

Shifted right by 111010100011110= 13,598, discarding the low bit

These bits as a double1.34371034 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime27,211+14

Previous prime27,191−6

Distance to nearest prime0, it is prime

Nearest square below26,896

Nearest square above27,225

Powers & multiples

27,197 to the power 2739,676,809

27,197 to the power 320,116,990,174,373

27,197 to the power 4547,121,781,772,422,481

27,197 to the power 514,880,071,098,864,574,215,757

First ten multiples27,197, 54,394, 81,591, 108,788, 135,985, 163,182, 190,379, 217,576, 244,773, 271,970

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 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 1121the total stopping time

Highest value reached176,7406× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps27,197 → 81,592 → 40,796 → 20,398 → 10,199 → 30,598 → 15,299 → 45,898 → 22,949 → 68,848 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,719,700%

27,197% as a decimal271.97

27,197% of 10027,197

27,197% of 1,000271,970

As a fraction of 10027,197/100

Read another way

As seconds7 hours, 33 minutes and 17 seconds

As bytes26.56 KiB

As a 24-bit colour#006A3D

Keep nerding

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