Recognised as Number

80,237

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value80,237

Digit count5

Digit sum20

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation19 × 41 × 103

Distinct prime factors319, 41, 103

Number of divisors8

Sum of divisors σ(n)87,360

Aliquot sum7,123sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)6,120the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 73,440

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

SquarefreeYesno repeated prime factor

All divisors1, 19, 41, 103, 779, 1,957, 4,223, 80,2378 in total

Arithmetic

Previous number80,236

Next number80,238

Double160,474

Half40,118.5

Square6,437,976,169

Cube516,563,893,872,053

Square root283.261363408≈irrational, shown to 9 decimal places

Cube root43.131201937≈

Negation-80,237

Reciprocal0.0000124631≈

Representations

Decimal80,237

Binary1001110010110110117 bits

Octal234555

Hexadecimal1396D

Base 361PWT

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

In wordseighty thousand, two hundred and thirty-seven

Ordinaleighty thousand, two hundred and thirty-seventh

Scientific notation8.0237 × 10^4

Engineering notation80.237 × 10^3

In other bases

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

Quinary10031422base 5; one hand: 8 digits

Septenary452633base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010011100101101101

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 39 6d

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

At each machine width

32-bit00000000000000010011100101101101

64-bit0000000000000000000000000000000000000000000000010011100101101101

One's complement11111111111111101100011010010010at 32 bits, every bit flipped

Bits reversed10110110100111001000000000000000at 32 bits

Rotated left by 100000000000000100111001011011010at 32 bits, wrapping

Shifted left by 1100111001011011010= 160,474, no wrap

Shifted right by 11001110010110110= 40,118, discarding the low bit

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

Nearest landmarks

Next prime80,239+2

Previous prime80,233−4

Distance to nearest prime2

Nearest square below80,089

Nearest square above80,656

Powers & multiples

80,237 to the power 26,437,976,169

80,237 to the power 3516,563,893,872,053

80,237 to the power 441,447,537,152,611,916,561

80,237 to the power 53,325,626,038,514,122,349,104,957

First ten multiples80,237, 160,474, 240,711, 320,948, 401,185, 481,422, 561,659, 641,896, 722,133, 802,370

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 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 5

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 1120the total stopping time

Highest value reached240,7123× the starting value

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

First steps80,237 → 240,712 → 120,356 → 60,178 → 30,089 → 90,268 → 45,134 → 22,567 → 67,702 → 33,851 → …

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

As a percentage & fraction

As a percentage8,023,700%

80,237% as a decimal802.37

80,237% of 10080,237

80,237% of 1,000802,370

As a fraction of 10080,237/100

Read another way

As seconds22 hours, 17 minutes and 17 seconds

As bytes78.356 KiB

As a 24-bit colour#01396D

Keep nerding

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