Recognised as Number

81,319

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value81,319

Digit count5

Digit sum22

Digit product216

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 11,617

Distinct prime factors27, 11,617

Number of divisors4

Sum of divisors σ(n)92,944

Aliquot sum11,625sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 11,617, 81,3194 in total

Arithmetic

Previous number81,318

Next number81,320

Double162,638

Half40,659.5

Square6,612,779,761

Cube537,744,637,384,759

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

Cube root43.324212413≈

Negation-81,319

Reciprocal0.0000122972≈

Representations

Decimal81,319

Binary1001111011010011117 bits

Octal236647

Hexadecimal13DA7

Base 361QQV

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

In wordseighty-one thousand, three hundred and nineteen

Ordinaleighty-one thousand, three hundred and nineteenth

Scientific notation8.1319 × 10^4

Engineering notation81.319 × 10^3

In other bases

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

Quinary10100234base 5; one hand: 8 digits

Septenary456040base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010011110110100111

Bit length17 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits6within that length

Bit parityodd11 set bits, so odd; 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 a7

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

At each machine width

32-bit00000000000000010011110110100111

64-bit0000000000000000000000000000000000000000000000010011110110100111

One's complement11111111111111101100001001011000at 32 bits, every bit flipped

Bits reversed11100101101111001000000000000000at 32 bits

Rotated left by 100000000000000100111101101001110at 32 bits, wrapping

Shifted left by 1100111101101001110= 162,638, no wrap

Shifted right by 11001111011010011= 40,659, discarding the low bit

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

Nearest landmarks

Next prime81,331+12

Previous prime81,307−12

Distance to nearest prime12

Nearest square below81,225

Nearest square above81,796

Powers & multiples

81,319 to the power 26,612,779,761

81,319 to the power 3537,744,637,384,759

81,319 to the power 443,728,856,167,491,217,121

81,319 to the power 53,555,986,854,684,218,285,062,599

First ten multiples81,319, 162,638, 243,957, 325,276, 406,595, 487,914, 569,233, 650,552, 731,871, 813,190

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 7

Divisible by 100No, remainder 19

Collatz (3n + 1) trajectory

Steps to reach 1226the total stopping time

Highest value reached617,5247× the starting value

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

First steps81,319 → 243,958 → 121,979 → 365,938 → 182,969 → 548,908 → 274,454 → 137,227 → 411,682 → 205,841 → …

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

As a percentage & fraction

As a percentage8,131,900%

81,319% as a decimal813.19

81,319% of 10081,319

81,319% of 1,000813,190

As a fraction of 10081,319/100

Read another way

As seconds22 hours, 35 minutes and 19 seconds

As bytes79.413 KiB

As a 24-bit colour#013DA7

Keep nerding

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