Recognised as Number
87,343
- Positive
- Odd
- Composite
- 5 digits
87,343 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value87,343
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 factorisation19 × 4,597
Distinct prime factors219, 4,597
Number of divisors4
Sum of divisors σ(n)91,960
Aliquot sum4,617sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)82,728integers below n that share no factor with it
Carmichael function λ(n)13,788the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 82,728
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 4,597, 87,3434 in total
Arithmetic
Representations
Decimal87,343
Binary1010101010010111117 bits
Octal252457
Hexadecimal1552F
Base 361VE7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-seven thousand, three hundred and forty-three
Ordinaleighty-seven thousand, three hundred and forty-third
Scientific notation8.7343 × 10^4
Engineering notation87.343 × 10^3
In other bases
Ternary11102210221base 3; the most digit-efficient integer base after e: 11 digits
Quinary10243333base 5; one hand: 8 digits
Septenary512434base 7: 6 digits
Nonary142727base 9; each digit is two ternary digits: 6 digits
Duodecimal42667base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalai73base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:15:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11110T110T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101010101110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010101010100101111
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 55 2f
Gray code11111111110111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010101010100101111
64-bit0000000000000000000000000000000000000000000000010101010100101111
One's complement11111111111111101010101011010000at 32 bits, every bit flipped
Bits reversed11110100101010101000000000000000at 32 bits
Rotated left by 100000000000000101010101001011110at 32 bits, wrapping
Shifted left by 1101010101001011110= 174,686, no wrap
Shifted right by 11010101010010111= 43,671, discarding the low bit
These bits as a double4.31531757 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
87,343 to the power 27,628,799,649
87,343 to the power 3666,322,247,742,607
87,343 to the power 458,198,584,084,582,523,201
87,343 to the power 55,083,238,929,699,691,323,944,943
First ten multiples87,343, 174,686, 262,029, 349,372, 436,715, 524,058, 611,401, 698,744, 786,087, 873,430
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 176the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps87,343 → 262,030 → 131,015 → 393,046 → 196,523 → 589,570 → 294,785 → 884,356 → 442,178 → 221,089 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,734,300%
87,343% as a decimal873.43
87,343% of 10087,343
87,343% of 1,000873,430
As a fraction of 10087,343/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 87,343
Nerdulate something else
Nothing in mind? Surprise me · today’s page