Recognised as Number

87,573

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value87,573

Digit count5

Digit sum30

Digit product5,880

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 29,191

Distinct prime factors23, 29,191

Number of divisors4

Sum of divisors σ(n)116,768

Aliquot sum29,195sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)29,190the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 58,380

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 29,191, 87,5734 in total

Arithmetic

Previous number87,572

Next number87,574

Double175,146

Half43,786.5

Square7,669,030,329

Cube671,599,993,001,517

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

Cube root44.407542749≈

Negation-87,573

Reciprocal0.000011419≈

Representations

Decimal87,573

Binary1010101100001010117 bits

Octal253025

Hexadecimal15615

Base 361VKL

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

In wordseighty-seven thousand, five hundred and seventy-three

Ordinaleighty-seven thousand, five hundred and seventy-third

Scientific notation8.7573 × 10^4

Engineering notation87.573 × 10^3

In other bases

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

Quinary10300243base 5; one hand: 8 digits

Septenary513213base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010101011000010101

Bit length17 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits9within that length

Bit parityeven8 set bits, so even; 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 15

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

At each machine width

32-bit00000000000000010101011000010101

64-bit0000000000000000000000000000000000000000000000010101011000010101

One's complement11111111111111101010100111101010at 32 bits, every bit flipped

Bits reversed10101000011010101000000000000000at 32 bits

Rotated left by 100000000000000101010110000101010at 32 bits, wrapping

Shifted left by 1101010110000101010= 175,146, no wrap

Shifted right by 11010101100001010= 43,786, discarding the low bit

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

Nearest landmarks

Next prime87,583+10

Previous prime87,559−14

Distance to nearest prime10

Nearest square below87,025

Nearest square above87,616

Powers & multiples

87,573 to the power 27,669,030,329

87,573 to the power 3671,599,993,001,517

87,573 to the power 458,814,026,187,121,848,241

87,573 to the power 55,150,520,715,284,821,616,009,093

First ten multiples87,573, 175,146, 262,719, 350,292, 437,865, 525,438, 613,011, 700,584, 788,157, 875,730

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 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 3

Divisible by 11No, remainder 2

Divisible by 12No, remainder 9

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1164the total stopping time

Highest value reached262,7203× the starting value

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

First steps87,573 → 262,720 → 131,360 → 65,680 → 32,840 → 16,420 → 8,210 → 4,105 → 12,316 → 6,158 → …

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

As a percentage & fraction

As a percentage8,757,300%

87,573% as a decimal875.73

87,573% of 10087,573

87,573% of 1,000875,730

As a fraction of 10087,573/100

Read another way

As seconds1 day, 19 minutes and 33 seconds

As bytes85.521 KiB

As a 24-bit colour#015615

Keep nerding

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