Recognised as Number

81,237

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value81,237

Digit count5

Digit sum21

Digit product336

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 13 × 2,083

Distinct prime factors33, 13, 2,083

Number of divisors8

Sum of divisors σ(n)116,704

Aliquot sum35,467sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,164the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 49,968

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 13, 39, 2,083, 6,249, 27,079, 81,2378 in total

Arithmetic

Previous number81,236

Next number81,238

Double162,474

Half40,618.5

Square6,599,450,169

Cube536,119,533,379,053

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

Cube root43.309645173≈

Negation-81,237

Reciprocal0.0000123097≈

Representations

Decimal81,237

Binary1001111010101010117 bits

Octal236525

Hexadecimal13D55

Base 361QOL

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

In wordseighty-one thousand, two hundred and thirty-seven

Ordinaleighty-one thousand, two hundred and thirty-seventh

Scientific notation8.1237 × 10^4

Engineering notation81.237 × 10^3

In other bases

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

Quinary10044422base 5; one hand: 8 digits

Septenary455562base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010011110101010101

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 55

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

At each machine width

32-bit00000000000000010011110101010101

64-bit0000000000000000000000000000000000000000000000010011110101010101

One's complement11111111111111101100001010101010at 32 bits, every bit flipped

Bits reversed10101010101111001000000000000000at 32 bits

Rotated left by 100000000000000100111101010101010at 32 bits, wrapping

Shifted left by 1100111101010101010= 162,474, no wrap

Shifted right by 11001111010101010= 40,618, discarding the low bit

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

Nearest landmarks

Next prime81,239+2

Previous prime81,233−4

Distance to nearest prime2

Nearest square below81,225

Nearest square above81,796

Powers & multiples

81,237 to the power 26,599,450,169

81,237 to the power 3536,119,533,379,053

81,237 to the power 443,552,742,533,114,128,561

81,237 to the power 53,538,094,145,162,592,461,909,957

First ten multiples81,237, 162,474, 243,711, 324,948, 406,185, 487,422, 568,659, 649,896, 731,133, 812,370

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 2

Divisible by 12No, remainder 9

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 145the total stopping time

Highest value reached243,7123× the starting value

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

First steps81,237 → 243,712 → 121,856 → 60,928 → 30,464 → 15,232 → 7,616 → 3,808 → 1,904 → 952 → …

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

As a percentage & fraction

As a percentage8,123,700%

81,237% as a decimal812.37

81,237% of 10081,237

81,237% of 1,000812,370

As a fraction of 10081,237/100

Read another way

As seconds22 hours, 33 minutes and 57 seconds

As bytes79.333 KiB

As a 24-bit colour#013D55

Keep nerding

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