Recognised as Number

81,197

Positive
Odd
Prime
5 digits

81,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 value81,197

Digit count5

Digit sum26

Digit product504

Multiplicative persistence2times 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 factorisation81,197

Distinct prime factors181,197

Number of divisors2

Sum of divisors σ(n)81,198

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)81,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, 81,1972 in total

Arithmetic

Previous number81,196

Next number81,198

Double162,394

Half40,598.5

Square6,592,952,809

Cube535,327,989,232,373

Square root284.950872959≈irrational, shown to 9 decimal places

Cube root43.302535645≈

Negation-81,197

Reciprocal0.0000123157≈

Representations

Decimal81,197

Binary1001111010010110117 bits

Octal236455

Hexadecimal13D2D

Base 361QNH

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

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

Ordinaleighty-one thousand, one hundred and ninety-seventh

Scientific notation8.1197 × 10^4

Engineering notation81.197 × 10^3

In other bases

Ternary11010101022base 3; the most digit-efficient integer base after e: 11 digits

Quinary10044242base 5; one hand: 8 digits

Septenary455504base 7: 6 digits

Nonary133338base 9; each digit is two ternary digits: 6 digits

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

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

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

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

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

Bit-level

00000000000000010011110100101101

Bit length17 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits7within that length

Bit parityeven10 set bits, so even; not the same as the number itself being odd

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 3d 2d

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

At each machine width

32-bit00000000000000010011110100101101

64-bit0000000000000000000000000000000000000000000000010011110100101101

One's complement11111111111111101100001011010010at 32 bits, every bit flipped

Bits reversed10110100101111001000000000000000at 32 bits

Rotated left by 100000000000000100111101001011010at 32 bits, wrapping

Shifted left by 1100111101001011010= 162,394, no wrap

Shifted right by 11001111010010110= 40,598, discarding the low bit

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

Nearest landmarks

Next prime81,199+2

Previous prime81,181−16

Distance to nearest prime0, it is prime

Nearest square below80,656

Nearest square above81,225

Powers & multiples

81,197 to the power 26,592,952,809

81,197 to the power 3535,327,989,232,373

81,197 to the power 443,467,026,741,700,990,481

81,197 to the power 53,529,392,170,345,895,324,085,757

First ten multiples81,197, 162,394, 243,591, 324,788, 405,985, 487,182, 568,379, 649,576, 730,773, 811,970

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

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 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 5

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 137the total stopping time

Highest value reached243,5923× the starting value

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

First steps81,197 → 243,592 → 121,796 → 60,898 → 30,449 → 91,348 → 45,674 → 22,837 → 68,512 → 34,256 → …

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

As a percentage & fraction

As a percentage8,119,700%

81,197% as a decimal811.97

81,197% of 10081,197

81,197% of 1,000811,970

As a fraction of 10081,197/100

Read another way

As seconds22 hours, 33 minutes and 17 seconds

As bytes79.294 KiB

As a 24-bit colour#013D2D

Keep nerding

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