Nerdulator> put something in

Recognised as Number

87,341

  • Positive
  • Odd
  • Composite
  • 5 digits

87,341 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 value87,341
Digit count5
Digit sum23
Digit product672
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation167 × 523
Distinct prime factors2167, 523
Number of divisors4
Sum of divisors σ(n)88,032
Aliquot sum691sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)86,652integers below n that share no factor with it
Carmichael function λ(n)43,326the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 86,652
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 167, 523, 87,3414 in total

Arithmetic

Previous number87,340
Next number87,342
Double174,682
Square root295.535107898≈irrational, shown to 9 decimal places
Cube root44.368292976≈
Negation-87,341
Reciprocal0.0000114494≈

Representations

Decimal87,341
Binary1010101010010110117 bits
Octal252455
Hexadecimal1552D
Base 361VE5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-seven thousand, three hundred and forty-one
Ordinaleighty-seven thousand, three hundred and forty-first
Scientific notation8.7341 × 10^4
Engineering notation87.341 × 10^3

In other bases

Ternary11102210212base 3; the most digit-efficient integer base after e: 11 digits
Quinary10243331base 5; one hand: 8 digits
Septenary512432base 7: 6 digits
Nonary142725base 9; each digit is two ternary digits: 6 digits
Duodecimal42665base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalai71base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:15:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11110T110TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101010101111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010101010100101101
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 odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 55 2d
Gray code11111111110111011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010101010100101101
64-bit0000000000000000000000000000000000000000000000010101010100101101
One's complement11111111111111101010101011010010at 32 bits, every bit flipped
Bits reversed10110100101010101000000000000000at 32 bits
Rotated left by 100000000000000101010101001011010at 32 bits, wrapping
Shifted left by 1101010101001011010= 174,682, no wrap
Shifted right by 11010101010010110= 43,670, discarding the low bit
These bits as a double4.31521876 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime87,359+18
Previous prime87,337−4
Distance to nearest prime4
Nearest square below87,025
Nearest square above87,616

Powers & multiples

87,341 to the power 27,628,450,281
87,341 to the power 3666,276,475,992,821
87,341 to the power 458,193,253,689,688,978,961
87,341 to the power 55,082,656,970,511,125,111,432,701
First ten multiples87,341, 174,682, 262,023, 349,364, 436,705, 524,046, 611,387, 698,728, 786,069, 873,410
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 171the total stopping time
Highest value reached262,0243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps87,341 → 262,024 → 131,012 → 65,506 → 32,753 → 98,260 → 49,130 → 24,565 → 73,696 → 36,848 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,734,100%
87,341% as a decimal873.41
87,341% of 10087,341
87,341% of 1,000873,410
As a fraction of 10087,341/100

Read another way

As bytes85.294 KiB
As a 24-bit colour#01552D

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 “87341” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.