Recognised as Number

87,567

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value87,567

Digit count5

Digit sum33

Digit product11,760

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 17^2 × 101

Distinct prime factors33, 17, 101

Number of divisors12

Sum of divisors σ(n)125,256

Aliquot sum37,689sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)6,800the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 54,400

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 17, 51, 101, 289, 303, 867, 1,717, 5,151, 29,189, 87,56712 in total

Arithmetic

Previous number87,566

Next number87,568

Double175,134

Half43,783.5

Square7,667,979,489

Cube671,461,959,913,263

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

Cube root44.406528542≈

Negation-87,567

Reciprocal0.0000114198≈

Representations

Decimal87,567

Binary1010101100000111117 bits

Octal253017

Hexadecimal1560F

Base 361VKF

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

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

Ordinaleighty-seven thousand, five hundred and sixty-seventh

Scientific notation8.7567 × 10^4

Engineering notation87.567 × 10^3

In other bases

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

Quinary10300232base 5; one hand: 8 digits

Septenary513204base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010101011000001111

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 56 0f

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

At each machine width

32-bit00000000000000010101011000001111

64-bit0000000000000000000000000000000000000000000000010101011000001111

One's complement11111111111111101010100111110000at 32 bits, every bit flipped

Bits reversed11110000011010101000000000000000at 32 bits

Rotated left by 100000000000000101010110000011110at 32 bits, wrapping

Shifted left by 1101010110000011110= 175,134, no wrap

Shifted right by 11010101100000111= 43,783, discarding the low bit

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

Nearest landmarks

Next prime87,583+16

Previous prime87,559−8

Distance to nearest prime8

Nearest square below87,025

Nearest square above87,616

Powers & multiples

87,567 to the power 27,667,979,489

87,567 to the power 3671,461,959,913,263

87,567 to the power 458,797,909,443,724,701,121

87,567 to the power 55,148,756,536,258,640,903,062,607

First ten multiples87,567, 175,134, 262,701, 350,268, 437,835, 525,402, 612,969, 700,536, 788,103, 875,670

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 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 3

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1102the total stopping time

Highest value reached886,62410× the starting value

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

First steps87,567 → 262,702 → 131,351 → 394,054 → 197,027 → 591,082 → 295,541 → 886,624 → 443,312 → 221,656 → …

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

As a percentage & fraction

As a percentage8,756,700%

87,567% as a decimal875.67

87,567% of 10087,567

87,567% of 1,000875,670

As a fraction of 10087,567/100

Read another way

As seconds1 day, 19 minutes and 27 seconds

As bytes85.515 KiB

As a 24-bit colour#01560F

Keep nerding

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