Recognised as Number

80,937

Positive
Odd
Composite
5 digits

80,937 is an odd 5-digit integer and a composite number. It has 18 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value80,937

Digit count5

Digit sum27

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 17 × 23^2

Distinct prime factors33, 17, 23

Number of divisors18

Sum of divisors σ(n)129,402

Aliquot sum48,465sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)12,144the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 48,576

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 17, 23, 51, 69, 153, 207, 391, 529, 1,173, 1,587, 3,519, 4,761, 8,993, 26,979, 80,93718 in total

Arithmetic

Previous number80,936

Next number80,938

Double161,874

Half40,468.5

Square6,550,797,969

Cube530,201,935,216,953

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

Cube root43.256266703≈

Negation-80,937

Reciprocal0.0000123553≈

Representations

Decimal80,937

Binary1001111000010100117 bits

Octal236051

Hexadecimal13C29

Base 361QG9

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

In wordseighty thousand, nine hundred and thirty-seven

Ordinaleighty thousand, nine hundred and thirty-seventh

Scientific notation8.0937 × 10^4

Engineering notation80.937 × 10^3

In other bases

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

Quinary10042222base 5; one hand: 8 digits

Septenary454653base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010011110000101001

Bit length17 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits9within that length

Bit parityeven8 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 3c 29

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

At each machine width

32-bit00000000000000010011110000101001

64-bit0000000000000000000000000000000000000000000000010011110000101001

One's complement11111111111111101100001111010110at 32 bits, every bit flipped

Bits reversed10010100001111001000000000000000at 32 bits

Rotated left by 100000000000000100111100001010010at 32 bits, wrapping

Shifted left by 1100111100001010010= 161,874, no wrap

Shifted right by 11001111000010100= 40,468, discarding the low bit

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

Nearest landmarks

Next prime80,953+16

Previous prime80,933−4

Distance to nearest prime4

Nearest square below80,656

Nearest square above81,225

Powers & multiples

80,937 to the power 26,550,797,969

80,937 to the power 3530,201,935,216,953

80,937 to the power 442,912,954,030,654,524,961

80,937 to the power 53,473,245,760,379,085,286,768,457

First ten multiples80,937, 161,874, 242,811, 323,748, 404,685, 485,622, 566,559, 647,496, 728,433, 809,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 3

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11No, remainder 10

Divisible by 12No, remainder 9

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 1138the total stopping time

Highest value reached921,94011× the starting value

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

First steps80,937 → 242,812 → 121,406 → 60,703 → 182,110 → 91,055 → 273,166 → 136,583 → 409,750 → 204,875 → …

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

As a percentage & fraction

As a percentage8,093,700%

80,937% as a decimal809.37

80,937% of 10080,937

80,937% of 1,000809,370

As a fraction of 10080,937/100

Read another way

As seconds22 hours, 28 minutes and 57 seconds

As bytes79.04 KiB

As a 24-bit colour#013C29

Keep nerding

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