Recognised as Number

87,565

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value87,565

Digit count5

Digit sum31

Digit product8,400

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 83 × 211

Distinct prime factors35, 83, 211

Number of divisors8

Sum of divisors σ(n)106,848

Aliquot sum19,283sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)17,220the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 68,880

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 83, 211, 415, 1,055, 17,513, 87,5658 in total

Arithmetic

Previous number87,564

Next number87,566

Double175,130

Half43,782.5

Square7,667,629,225

Cube671,415,953,087,125

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

Cube root44.406190463≈

Negation-87,565

Reciprocal0.0000114201≈

Representations

Decimal87,565

Binary1010101100000110117 bits

Octal253015

Hexadecimal1560D

Base 361VKD

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

In wordseighty-seven thousand, five hundred and sixty-five

Ordinaleighty-seven thousand, five hundred and sixty-fifth

Scientific notation8.7565 × 10^4

Engineering notation87.565 × 10^3

In other bases

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

Quinary10300230base 5; one hand: 8 digits

Septenary513202base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010101011000001101

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 0d

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

At each machine width

32-bit00000000000000010101011000001101

64-bit0000000000000000000000000000000000000000000000010101011000001101

One's complement11111111111111101010100111110010at 32 bits, every bit flipped

Bits reversed10110000011010101000000000000000at 32 bits

Rotated left by 100000000000000101010110000011010at 32 bits, wrapping

Shifted left by 1101010110000011010= 175,130, no wrap

Shifted right by 11010101100000110= 43,782, discarding the low bit

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

Nearest landmarks

Next prime87,583+18

Previous prime87,559−6

Distance to nearest prime6

Nearest square below87,025

Nearest square above87,616

Powers & multiples

87,565 to the power 27,667,629,225

87,565 to the power 3671,415,953,087,125

87,565 to the power 458,792,537,932,074,100,625

87,565 to the power 55,148,168,584,022,068,621,228,125

First ten multiples87,565, 175,130, 262,695, 350,260, 437,825, 525,390, 612,955, 700,520, 788,085, 875,650

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 145the total stopping time

Highest value reached262,6963× the starting value

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

First steps87,565 → 262,696 → 131,348 → 65,674 → 32,837 → 98,512 → 49,256 → 24,628 → 12,314 → 6,157 → …

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

As a percentage & fraction

As a percentage8,756,500%

87,565% as a decimal875.65

87,565% of 10087,565

87,565% of 1,000875,650

As a fraction of 10087,565/100

Read another way

As seconds1 day, 19 minutes and 25 seconds

As bytes85.513 KiB

As a 24-bit colour#01560D

Keep nerding

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