Nerdulator> put something in

Recognised as Number

87,741

  • Positive
  • Odd
  • Composite
  • 5 digits

87,741 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value87,741
Digit count5
Digit sum27
Digit product1,568
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 9,749
Distinct prime factors23, 9,749
Number of divisors6
Sum of divisors σ(n)126,750
Aliquot sum39,009sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)58,488integers below n that share no factor with it
Carmichael function λ(n)29,244the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 58,488
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 9,749, 29,247, 87,7416 in total

Arithmetic

Previous number87,740
Next number87,742
Double175,482
Square root296.211073392≈irrational, shown to 9 decimal places
Cube root44.435921745≈
Negation-87,741
Reciprocal0.0000113972≈

Representations

Decimal87,741
Binary1010101101011110117 bits
Octal253275
Hexadecimal156BD
Base 361VP9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-seven thousand, seven hundred and forty-one
Ordinaleighty-seven thousand, seven hundred and forty-first
Scientific notation8.7741 × 10^4
Engineering notation87.741 × 10^3

In other bases

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

Bit-level

00000000000000010101011010111101
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 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 56 bd
Gray code11111110111100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010101011010111101
64-bit0000000000000000000000000000000000000000000000010101011010111101
One's complement11111111111111101010100101000010at 32 bits, every bit flipped
Bits reversed10111101011010101000000000000000at 32 bits
Rotated left by 100000000000000101010110101111010at 32 bits, wrapping
Shifted left by 1101010110101111010= 175,482, no wrap
Shifted right by 11010101101011110= 43,870, discarding the low bit
These bits as a double4.33498138 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime87,743+2
Previous prime87,739−2
Distance to nearest prime2
Nearest square below87,616
Nearest square above88,209

Powers & multiples

87,741 to the power 27,698,483,081
87,741 to the power 3675,472,604,010,021
87,741 to the power 459,266,641,748,443,252,561
87,741 to the power 55,200,114,413,650,159,422,954,701
First ten multiples87,741, 175,482, 263,223, 350,964, 438,705, 526,446, 614,187, 701,928, 789,669, 877,410
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1164the total stopping time
Highest value reached263,2243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps87,741 → 263,224 → 131,612 → 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,100%
87,741% as a decimal877.41
87,741% of 10087,741
87,741% of 1,000877,410
As a fraction of 10087,741/100

Read another way

As bytes85.685 KiB
As a 24-bit colour#0156BD

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