Recognised as Number

76,811

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value76,811

Digit count5

Digit sum23

Digit product336

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 10,973

Distinct prime factors27, 10,973

Number of divisors4

Sum of divisors σ(n)87,792

Aliquot sum10,981sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)32,916the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 65,832

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 10,973, 76,8114 in total

Arithmetic

Previous number76,810

Next number76,812

Double153,622

Half38,405.5

Square5,899,929,721

Cube453,179,501,799,731

Square root277.147974916≈irrational, shown to 9 decimal places

Cube root42.508372053≈

Negation-76,811

Reciprocal0.000013019≈

Representations

Decimal76,811

Binary1001011000000101117 bits

Octal226013

Hexadecimal12C0B

Base 361N9N

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

In wordsseventy-six thousand, eight hundred and eleven

Ordinalseventy-six thousand, eight hundred and eleventh

Scientific notation7.6811 × 10^4

Engineering notation76.811 × 10^3

In other bases

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

Quinary4424221base 5; one hand: 7 digits

Septenary436640base 7: 6 digits

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

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

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

Sexagesimal21:20:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010010110000001011

Bit length17 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits10within that length

Bit parityodd7 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 2c 0b

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

At each machine width

32-bit00000000000000010010110000001011

64-bit0000000000000000000000000000000000000000000000010010110000001011

One's complement11111111111111101101001111110100at 32 bits, every bit flipped

Bits reversed11010000001101001000000000000000at 32 bits

Rotated left by 100000000000000100101100000010110at 32 bits, wrapping

Shifted left by 1100101100000010110= 153,622, no wrap

Shifted right by 11001011000000101= 38,405, discarding the low bit

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

Nearest landmarks

Next prime76,819+8

Previous prime76,801−10

Distance to nearest prime8

Nearest square below76,729

Nearest square above77,284

Powers & multiples

76,811 to the power 25,899,929,721

76,811 to the power 3453,179,501,799,731

76,811 to the power 434,809,170,712,739,137,841

76,811 to the power 52,673,727,211,616,205,916,705,051

First ten multiples76,811, 153,622, 230,433, 307,244, 384,055, 460,866, 537,677, 614,488, 691,299, 768,110

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 3

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 11

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1169the total stopping time

Highest value reached345,6524× the starting value

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

First steps76,811 → 230,434 → 115,217 → 345,652 → 172,826 → 86,413 → 259,240 → 129,620 → 64,810 → 32,405 → …

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

As a percentage & fraction

As a percentage7,681,100%

76,811% as a decimal768.11

76,811% of 10076,811

76,811% of 1,000768,110

As a fraction of 10076,811/100

Read another way

As seconds21 hours, 20 minutes and 11 seconds

As bytes75.011 KiB

As a 24-bit colour#012C0B

Keep nerding

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