Recognised as Number

87,433

Positive
Odd
Prime
5 digits

87,433 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,433

Digit count5

Digit sum25

Digit product2,016

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,433

Distinct prime factors187,433

Number of divisors2

Sum of divisors σ(n)87,434

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)87,432the 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,4332 in total

Arithmetic

Previous number87,432

Next number87,434

Double174,866

Half43,716.5

Square7,644,529,489

Cube668,384,146,811,737

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

Cube root44.383865847≈

Negation-87,433

Reciprocal0.0000114373≈

Representations

Decimal87,433

Binary1010101011000100117 bits

Octal252611

Hexadecimal15589

Base 361VGP

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

In wordseighty-seven thousand, four hundred and thirty-three

Ordinaleighty-seven thousand, four hundred and thirty-third

Scientific notation8.7433 × 10^4

Engineering notation87.433 × 10^3

In other bases

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

Quinary10244213base 5; one hand: 8 digits

Septenary512623base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010101010110001001

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 55 89

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

At each machine width

32-bit00000000000000010101010110001001

64-bit0000000000000000000000000000000000000000000000010101010110001001

One's complement11111111111111101010101001110110at 32 bits, every bit flipped

Bits reversed10010001101010101000000000000000at 32 bits

Rotated left by 100000000000000101010101100010010at 32 bits, wrapping

Shifted left by 1101010101100010010= 174,866, no wrap

Shifted right by 11010101011000100= 43,716, discarding the low bit

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

Nearest landmarks

Next prime87,443+10

Previous prime87,427−6

Distance to nearest prime0, it is prime

Nearest square below87,025

Nearest square above87,616

Powers & multiples

87,433 to the power 27,644,529,489

87,433 to the power 3668,384,146,811,737

87,433 to the power 458,438,831,108,190,601,121

87,433 to the power 55,109,482,320,282,428,827,812,393

First ten multiples87,433, 174,866, 262,299, 349,732, 437,165, 524,598, 612,031, 699,464, 786,897, 874,330

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 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1102the total stopping time

Highest value reached497,9685× the starting value

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

First steps87,433 → 262,300 → 131,150 → 65,575 → 196,726 → 98,363 → 295,090 → 147,545 → 442,636 → 221,318 → …

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

As a percentage & fraction

As a percentage8,743,300%

87,433% as a decimal874.33

87,433% of 10087,433

87,433% of 1,000874,330

As a fraction of 10087,433/100

Read another way

As seconds1 day, 17 minutes and 13 seconds

As bytes85.384 KiB

As a 24-bit colour#015589

Keep nerding

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