Nerdulator> put something in

Recognised as Number

76,882

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value76,882
Digit count5
Digit sum31
Digit product5,376
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 factorisation2 × 13 × 2,957
Distinct prime factors32, 13, 2,957
Number of divisors8
Sum of divisors σ(n)124,236
Aliquot sum47,354sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)35,472integers below n that share no factor with it
Carmichael function λ(n)8,868the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 35,472
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 13, 26, 2,957, 5,914, 38,441, 76,8828 in total

Arithmetic

Previous number76,881
Next number76,883
Double153,764
Half38,441
Square root277.276035748≈irrational, shown to 9 decimal places
Cube root42.521465512≈
Negation-76,882
Reciprocal0.0000130069≈

Representations

Decimal76,882
Binary1001011000101001017 bits
Octal226122
Hexadecimal12C52
Base 361NBM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-six thousand, eight hundred and eighty-two
Ordinalseventy-six thousand, eight hundred and eighty-second
Scientific notation7.6882 × 10^4
Engineering notation76.882 × 10^3

In other bases

Ternary10220110111base 3; the most digit-efficient integer base after e: 11 digits
Quinary4430012base 5; one hand: 7 digits
Septenary440101base 7: 6 digits
Nonary126414base 9; each digit is two ternary digits: 6 digits
Duodecimal385aabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9c42base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:21:22base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110T0110111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111110001010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010010110001010010
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 2c 52
Gray code11011101001111011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010010110001010010
64-bit0000000000000000000000000000000000000000000000010010110001010010
One's complement11111111111111101101001110101101at 32 bits, every bit flipped
Bits reversed01001010001101001000000000000000at 32 bits
Rotated left by 100000000000000100101100010100100at 32 bits, wrapping
Shifted left by 1100101100010100100= 153,764, no wrap
Shifted right by 11001011000101001= 38,441, discarding the low bit
These bits as a double3.7984755 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime76,883+1
Previous prime76,873−9
Distance to nearest prime1
Nearest square below76,729
Nearest square above77,284

Powers & multiples

76,882 to the power 25,910,841,924
76,882 to the power 3454,437,348,800,968
76,882 to the power 434,938,052,250,516,021,776
76,882 to the power 52,686,107,333,124,172,786,182,432
First ten multiples76,882, 153,764, 230,646, 307,528, 384,410, 461,292, 538,174, 615,056, 691,938, 768,820
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 82

Collatz (3n + 1) trajectory

Steps to reach 1231the total stopping time
Highest value reached5,399,29670× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps76,882 → 38,441 → 115,324 → 57,662 → 28,831 → 86,494 → 43,247 → 129,742 → 64,871 → 194,614 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,688,200%
76,882% as a decimal768.82
76,882% of 10076,882
76,882% of 1,000768,820
As a fraction of 10076,882/100

Read another way

As bytes75.08 KiB
As a 24-bit colour#012C52

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “76882” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.