Recognised as Number

81,317

Positive
Odd
Composite
5 digits

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

Digit count5

Digit sum20

Digit product168

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 factorisation233 × 349

Distinct prime factors2233, 349

Number of divisors4

Sum of divisors σ(n)81,900

Aliquot sum583sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)696the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 80,736

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 233, 349, 81,3174 in total

Arithmetic

Previous number81,316

Next number81,318

Double162,634

Half40,658.5

Square6,612,454,489

Cube537,704,961,682,013

Square root285.161357831≈irrational, shown to 9 decimal places

Cube root43.323857231≈

Negation-81,317

Reciprocal0.0000122976≈

Representations

Decimal81,317

Binary1001111011010010117 bits

Octal236645

Hexadecimal13DA5

Base 361QQT

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

In wordseighty-one thousand, three hundred and seventeen

Ordinaleighty-one thousand, three hundred and seventeenth

Scientific notation8.1317 × 10^4

Engineering notation81.317 × 10^3

In other bases

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

Quinary10100232base 5; one hand: 8 digits

Septenary456035base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010011110110100101

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 a5

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

At each machine width

32-bit00000000000000010011110110100101

64-bit0000000000000000000000000000000000000000000000010011110110100101

One's complement11111111111111101100001001011010at 32 bits, every bit flipped

Bits reversed10100101101111001000000000000000at 32 bits

Rotated left by 100000000000000100111101101001010at 32 bits, wrapping

Shifted left by 1100111101101001010= 162,634, no wrap

Shifted right by 11001111011010010= 40,658, discarding the low bit

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

Nearest landmarks

Next prime81,331+14

Previous prime81,307−10

Distance to nearest prime10

Nearest square below81,225

Nearest square above81,796

Powers & multiples

81,317 to the power 26,612,454,489

81,317 to the power 3537,704,961,682,013

81,317 to the power 443,724,554,369,096,251,121

81,317 to the power 53,555,549,587,631,799,852,406,357

First ten multiples81,317, 162,634, 243,951, 325,268, 406,585, 487,902, 569,219, 650,536, 731,853, 813,170

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 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 7

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 17

Collatz (3n + 1) trajectory

Steps to reach 176the total stopping time

Highest value reached243,9523× the starting value

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

First steps81,317 → 243,952 → 121,976 → 60,988 → 30,494 → 15,247 → 45,742 → 22,871 → 68,614 → 34,307 → …

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

As a percentage & fraction

As a percentage8,131,700%

81,317% as a decimal813.17

81,317% of 10081,317

81,317% of 1,000813,170

As a fraction of 10081,317/100

Read another way

As seconds22 hours, 35 minutes and 17 seconds

As bytes79.411 KiB

As a 24-bit colour#013DA5

Keep nerding

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