Nerdulator> put something in

Recognised as Number

87,613

  • Positive
  • Odd
  • Prime
  • 5 digits

87,613 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value87,613
Digit count5
Digit sum25
Digit product1,008
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation87,613
Distinct prime factors187,613
Number of divisors2
Sum of divisors σ(n)87,614
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)87,612integers below n that share no factor with it
Carmichael function λ(n)87,612the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 87,6132 in total

Arithmetic

Previous number87,612
Next number87,614
Double175,226
Square root295.994932389≈irrational, shown to 9 decimal places
Cube root44.414302943≈
Negation-87,613
Reciprocal0.0000114138≈

Representations

Decimal87,613
Binary1010101100011110117 bits
Octal253075
Hexadecimal1563D
Base 361VLP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-seven thousand, six hundred and thirteen
Ordinaleighty-seven thousand, six hundred and thirteenth
Scientific notation8.7613 × 10^4
Engineering notation87.613 × 10^3

In other bases

Ternary11110011221base 3; the most digit-efficient integer base after e: 11 digits
Quinary10300423base 5; one hand: 8 digits
Septenary513301base 7: 6 digits
Nonary143157base 9; each digit is two ternary digits: 6 digits
Duodecimal42851base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalaj0dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:20:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111101TT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010101001001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010101011000111101
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 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 3d
Gray code11111110100100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010101011000111101
64-bit0000000000000000000000000000000000000000000000010101011000111101
One's complement11111111111111101010100111000010at 32 bits, every bit flipped
Bits reversed10111100011010101000000000000000at 32 bits
Rotated left by 100000000000000101010110001111010at 32 bits, wrapping
Shifted left by 1101010110001111010= 175,226, no wrap
Shifted right by 11010101100011110= 43,806, discarding the low bit
These bits as a double4.32865734 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime87,623+10
Previous prime87,589−24
Distance to nearest prime0, it is prime
Nearest square below87,025
Nearest square above87,616

Powers & multiples

87,613 to the power 27,676,037,769
87,613 to the power 3672,520,697,055,397
87,613 to the power 458,921,555,831,114,497,361
87,613 to the power 55,162,294,271,031,434,457,289,293
First ten multiples87,613, 175,226, 262,839, 350,452, 438,065, 525,678, 613,291, 700,904, 788,517, 876,130
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 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1164the total stopping time
Highest value reached262,8403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps87,613 → 262,840 → 131,420 → 65,710 → 32,855 → 98,566 → 49,283 → 147,850 → 73,925 → 221,776 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,761,300%
87,613% as a decimal876.13
87,613% of 10087,613
87,613% of 1,000876,130
As a fraction of 10087,613/100

Read another way

As bytes85.56 KiB
As a 24-bit colour#01563D

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “87613” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.