Nerdulator> put something in

Recognised as Number

87,435

  • Positive
  • Odd
  • Composite
  • 5 digits

87,435 is an odd 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value87,435
Digit count5
Digit sum27
Digit product3,360
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5 × 29 × 67
Distinct prime factors43, 5, 29, 67
Number of divisors24
Sum of divisors σ(n)159,120
Aliquot sum71,685sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)44,352integers below n that share no factor with it
Carmichael function λ(n)924the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 44,352
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 29, 45, 67, 87, 145, 201, 261, 335, 435, 603, 1,005, 1,305, 1,943, 3,015, 5,829, 9,715, 17,487, 29,145, 87,43524 in total

Arithmetic

Previous number87,434
Next number87,436
Double174,870
Square root295.69409869≈irrational, shown to 9 decimal places
Cube root44.384204267≈
Negation-87,435
Reciprocal0.0000114371≈

Representations

Decimal87,435
Binary1010101011000101117 bits
Octal252613
Hexadecimal1558B
Base 361VGR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-seven thousand, four hundred and thirty-five
Ordinaleighty-seven thousand, four hundred and thirty-fifth
Scientific notation8.7435 × 10^4
Engineering notation87.435 × 10^3

In other bases

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

Bit-level

00000000000000010101010110001011
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 55 8b
Gray code11111111101001110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010101010110001011
64-bit0000000000000000000000000000000000000000000000010101010110001011
One's complement11111111111111101010101001110100at 32 bits, every bit flipped
Bits reversed11010001101010101000000000000000at 32 bits
Rotated left by 100000000000000101010101100010110at 32 bits, wrapping
Shifted left by 1101010101100010110= 174,870, no wrap
Shifted right by 11010101011000101= 43,717, discarding the low bit
These bits as a double4.31986297 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime87,443+8
Previous prime87,433−2
Distance to nearest prime2
Nearest square below87,025
Nearest square above87,616

Powers & multiples

87,435 to the power 27,644,879,225
87,435 to the power 3668,430,015,037,875
87,435 to the power 458,444,178,364,836,600,625
87,435 to the power 55,110,066,735,329,488,175,646,875
First ten multiples87,435, 174,870, 262,305, 349,740, 437,175, 524,610, 612,045, 699,480, 786,915, 874,350
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 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time
Highest value reached393,4604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps87,435 → 262,306 → 131,153 → 393,460 → 196,730 → 98,365 → 295,096 → 147,548 → 73,774 → 36,887 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,743,500%
87,435% as a decimal874.35
87,435% of 10087,435
87,435% of 1,000874,350
As a fraction of 10087,435/100

Read another way

As bytes85.386 KiB
As a 24-bit colour#01558B

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 “87435” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.