Recognised as Number
80,684
- Positive
- Even
- Composite
- 5 digits
80,684 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value80,684
Digit count5
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 23 × 877
Distinct prime factors32, 23, 877
Number of divisors12
Sum of divisors σ(n)147,504
Aliquot sum66,820sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)38,544integers below n that share no factor with it
Carmichael function λ(n)9,636the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,544
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 23, 46, 92, 877, 1,754, 3,508, 20,171, 40,342, 80,68412 in total
Arithmetic
Representations
Decimal80,684
Binary1001110110010110017 bits
Octal235454
Hexadecimal13B2C
Base 361Q98
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty thousand, six hundred and eighty-four
Ordinaleighty thousand, six hundred and eighty-fourth
Scientific notation8.0684 × 10^4
Engineering notation80.684 × 10^3
In other bases
Ternary11002200022base 3; the most digit-efficient integer base after e: 11 digits
Quinary10040214base 5; one hand: 8 digits
Septenary454142base 7: 6 digits
Nonary132608base 9; each digit is two ternary digits: 6 digits
Duodecimal3a838base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala1e4base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal22:24:44base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11010T0010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100111101111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010011101100101100
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes301 3b 2c
Gray code11010011010111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010011101100101100
64-bit0000000000000000000000000000000000000000000000010011101100101100
One's complement11111111111111101100010011010011at 32 bits, every bit flipped
Bits reversed00110100110111001000000000000000at 32 bits
Rotated left by 100000000000000100111011001011000at 32 bits, wrapping
Shifted left by 1100111011001011000= 161,368, no wrap
Shifted right by 11001110110010110= 40,342, discarding the low bit
These bits as a double3.98631926 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
80,684 to the power 26,509,907,856
80,684 to the power 3525,245,405,453,504
80,684 to the power 442,378,900,293,610,516,736
80,684 to the power 53,419,299,191,289,670,932,327,424
First ten multiples80,684, 161,368, 242,052, 322,736, 403,420, 484,104, 564,788, 645,472, 726,156, 806,840
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 8
Divisible by 10No, remainder 4
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 84
Collatz (3n + 1) trajectory
Steps to reach 1213the total stopping time
Highest value reached6,810,13684× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps80,684 → 40,342 → 20,171 → 60,514 → 30,257 → 90,772 → 45,386 → 22,693 → 68,080 → 34,040 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,068,400%
80,684% as a decimal806.84
80,684% of 10080,684
80,684% of 1,000806,840
As a fraction of 10080,684/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 80,684
Nerdulate something else
Nothing in mind? Surprise me · today’s page