Recognised as Number

87,572

Positive
Even
Composite
5 digits

87,572 is an even 5-digit integer and a composite number. It has 6 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value87,572

Digit count5

Digit sum29

Digit product3,920

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 21,893

Distinct prime factors22, 21,893

Number of divisors6

Sum of divisors σ(n)153,258

Aliquot sum65,686sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)21,892the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 43,784

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 21,893, 43,786, 87,5726 in total

Arithmetic

Previous number87,571

Next number87,573

Double175,144

Half43,786

Square7,668,855,184

Cube671,576,986,173,248

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

Cube root44.407373718≈

Negation-87,572

Reciprocal0.0000114192≈

Representations

Decimal87,572

Binary1010101100001010017 bits

Octal253024

Hexadecimal15614

Base 361VKK

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

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

Ordinaleighty-seven thousand, five hundred and seventy-second

Scientific notation8.7572 × 10^4

Engineering notation87.572 × 10^3

In other bases

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

Quinary10300242base 5; one hand: 8 digits

Septenary513212base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010101011000010100

Bit length17 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits10within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being even

Highest set bitbit 16worth 65,536

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes301 56 14

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

At each machine width

32-bit00000000000000010101011000010100

64-bit0000000000000000000000000000000000000000000000010101011000010100

One's complement11111111111111101010100111101011at 32 bits, every bit flipped

Bits reversed00101000011010101000000000000000at 32 bits

Rotated left by 100000000000000101010110000101000at 32 bits, wrapping

Shifted left by 1101010110000101000= 175,144, no wrap

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

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

Nearest landmarks

Next prime87,583+11

Previous prime87,559−13

Distance to nearest prime11

Nearest square below87,025

Nearest square above87,616

Powers & multiples

87,572 to the power 27,668,855,184

87,572 to the power 3671,576,986,173,248

87,572 to the power 458,811,339,833,163,673,856

87,572 to the power 55,150,226,651,869,809,246,917,632

First ten multiples87,572, 175,144, 262,716, 350,288, 437,860, 525,432, 613,004, 700,576, 788,148, 875,720

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8No, remainder 4

Divisible by 9No, remainder 2

Divisible by 10No, remainder 2

Divisible by 11No, remainder 1

Divisible by 12No, remainder 8

Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 1164the total stopping time

Highest value reached87,572

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

First steps87,572 → 43,786 → 21,893 → 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,200%

87,572% as a decimal875.72

87,572% of 10087,572

87,572% of 1,000875,720

As a fraction of 10087,572/100

Read another way

As seconds1 day, 19 minutes and 32 seconds

As bytes85.52 KiB

As a 24-bit colour#015614

Keep nerding

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