Recognised as Number

87,461

Positive
Odd
Composite
5 digits

87,461 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value87,461

Digit count5

Digit sum26

Digit product1,344

Multiplicative persistence4times 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 factorisation11 × 7,951

Distinct prime factors211, 7,951

Number of divisors4

Sum of divisors σ(n)95,424

Aliquot sum7,963sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)79,500integers below n that share no factor with it

Carmichael function λ(n)7,950the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 79,500

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 11, 7,951, 87,4614 in total

Arithmetic

Previous number87,460

Next number87,462

Double174,922

Half43,730.5

Square7,649,426,521

Cube669,026,492,953,181

Square root295.738059776≈irrational, shown to 9 decimal places

Cube root44.388603249≈

Negation-87,461

Reciprocal0.0000114337≈

Representations

Decimal87,461

Binary1010101011010010117 bits

Octal252645

Hexadecimal155A5

Base 361VHH

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordseighty-seven thousand, four hundred and sixty-one

Ordinaleighty-seven thousand, four hundred and sixty-first

Scientific notation8.7461 × 10^4

Engineering notation87.461 × 10^3

In other bases

Ternary11102222022base 3; the most digit-efficient integer base after e: 11 digits

Quinary10244321base 5; one hand: 8 digits

Septenary512663base 7: 6 digits

Nonary142868base 9; each digit is two ternary digits: 6 digits

Duodecimal42745base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimalaid1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal24:17:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1111000T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1101010101011100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010101010110100101

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 a5

Gray code11111111101110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010101010110100101

64-bit0000000000000000000000000000000000000000000000010101010110100101

One's complement11111111111111101010101001011010at 32 bits, every bit flipped

Bits reversed10100101101010101000000000000000at 32 bits

Rotated left by 100000000000000101010101101001010at 32 bits, wrapping

Shifted left by 1101010101101001010= 174,922, no wrap

Shifted right by 11010101011010010= 43,730, discarding the low bit

These bits as a double4.32114755 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime87,473+12

Previous prime87,443−18

Distance to nearest prime12

Nearest square below87,025

Nearest square above87,616

Powers & multiples

87,461 to the power 27,649,426,521

87,461 to the power 3669,026,492,953,181

87,461 to the power 458,513,726,100,178,163,441

87,461 to the power 55,117,668,998,447,682,352,713,301

First ten multiples87,461, 174,922, 262,383, 349,844, 437,305, 524,766, 612,227, 699,688, 787,149, 874,610

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 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1120the total stopping time

Highest value reached262,3843× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps87,461 → 262,384 → 131,192 → 65,596 → 32,798 → 16,399 → 49,198 → 24,599 → 73,798 → 36,899 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,746,100%

87,461% as a decimal874.61

87,461% of 10087,461

87,461% of 1,000874,610

As a fraction of 10087,461/100

Read another way

As seconds1 day, 17 minutes and 41 seconds

As bytes85.411 KiB

As a 24-bit colour#0155A5

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.