Recognised as Number
80,878
- Positive
- Even
- Composite
- 5 digits
80,878 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value80,878
Digit count5
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 7 × 53 × 109
Distinct prime factors42, 7, 53, 109
Number of divisors16
Sum of divisors σ(n)142,560
Aliquot sum61,682sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)33,696integers below n that share no factor with it
Carmichael function λ(n)1,404the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 33,696
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 53, 106, 109, 218, 371, 742, 763, 1,526, 5,777, 11,554, 40,439, 80,87816 in total
Arithmetic
Representations
Decimal80,878
Binary1001110111110111017 bits
Octal235756
Hexadecimal13BEE
Base 361QEM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty thousand, eight hundred and seventy-eight
Ordinaleighty thousand, eight hundred and seventy-eighth
Scientific notation8.0878 × 10^4
Engineering notation80.878 × 10^3
In other bases
Ternary11002221111base 3; the most digit-efficient integer base after e: 11 digits
Quinary10042003base 5; one hand: 8 digits
Septenary454540base 7: 6 digits
Nonary132844base 9; each digit is two ternary digits: 6 digits
Duodecimal3a97abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala23ibase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal22:27:58base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110100T1111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100110000110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010011101111101110
Bit length17 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits5within that length
Bit parityeven12 set bits, so even; 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 3b ee
Gray code11010011000011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010011101111101110
64-bit0000000000000000000000000000000000000000000000010011101111101110
One's complement11111111111111101100010000010001at 32 bits, every bit flipped
Bits reversed01110111110111001000000000000000at 32 bits
Rotated left by 100000000000000100111011111011100at 32 bits, wrapping
Shifted left by 1100111011111011100= 161,756, no wrap
Shifted right by 11001110111110111= 40,439, discarding the low bit
These bits as a double3.99590413 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
80,878 to the power 26,541,250,884
80,878 to the power 3529,043,288,996,152
80,878 to the power 442,787,963,127,430,781,456
80,878 to the power 53,460,604,881,820,346,742,598,368
First ten multiples80,878, 161,756, 242,634, 323,512, 404,390, 485,268, 566,146, 647,024, 727,902, 808,780
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 3
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10No, remainder 8
Divisible by 11No, remainder 6
Divisible by 12No, remainder 10
Divisible by 100No, remainder 78
Collatz (3n + 1) trajectory
Steps to reach 189the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps80,878 → 40,439 → 121,318 → 60,659 → 181,978 → 90,989 → 272,968 → 136,484 → 68,242 → 34,121 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,087,800%
80,878% as a decimal808.78
80,878% of 10080,878
80,878% of 1,000808,780
As a fraction of 10080,878/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,878
Nerdulate something else
Nothing in mind? Surprise me · today’s page