Recognised as Number
87,740
- Positive
- Even
- Composite
- 5 digits
87,740 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value87,740
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 × 5 × 41 × 107
Distinct prime factors42, 5, 41, 107
Number of divisors24
Sum of divisors σ(n)190,512
Aliquot sum102,772sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)33,920integers below n that share no factor with it
Carmichael function λ(n)2,120the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 33,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 41, 82, 107, 164, 205, 214, 410, 428, 535, 820, 1,070, 2,140, 4,387, 8,774, 17,548, 21,935, 43,870, 87,74024 in total
Arithmetic
Representations
Decimal87,740
Binary1010101101011110017 bits
Octal253274
Hexadecimal156BC
Base 361VP8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-seven thousand, seven hundred and forty
Ordinaleighty-seven thousand, seven hundred and fortieth
Scientific notation8.774 × 10^4
Engineering notation87.74 × 10^3
In other bases
Ternary11110100122base 3; the most digit-efficient integer base after e: 11 digits
Quinary10301430base 5; one hand: 8 digits
Septenary513542base 7: 6 digits
Nonary143318base 9; each digit is two ternary digits: 6 digits
Duodecimal42938base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalaj70base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:22:20base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11110101T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010101111001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010101011010111100
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes301 56 bc
Gray code11111110111100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010101011010111100
64-bit0000000000000000000000000000000000000000000000010101011010111100
One's complement11111111111111101010100101000011at 32 bits, every bit flipped
Bits reversed00111101011010101000000000000000at 32 bits
Rotated left by 100000000000000101010110101111000at 32 bits, wrapping
Shifted left by 1101010110101111000= 175,480, no wrap
Shifted right by 11010101101011110= 43,870, discarding the low bit
These bits as a double4.33493198 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
87,740 to the power 27,698,307,600
87,740 to the power 3675,449,508,824,000
87,740 to the power 459,263,939,904,217,760,000
87,740 to the power 55,199,818,087,196,066,262,400,000
First ten multiples87,740, 175,480, 263,220, 350,960, 438,700, 526,440, 614,180, 701,920, 789,660, 877,400
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 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 8
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 8
Divisible by 100No, remainder 40
Collatz (3n + 1) trajectory
Steps to reach 1164the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps87,740 → 43,870 → 21,935 → 65,806 → 32,903 → 98,710 → 49,355 → 148,066 → 74,033 → 222,100 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,774,000%
87,740% as a decimal877.4
87,740% of 10087,740
87,740% of 1,000877,400
As a fraction of 10087,740/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 87,740
Nerdulate something else
Nothing in mind? Surprise me · today’s page