Recognised as Number
87,462
- Positive
- Even
- Composite
- 5 digits
87,462 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value87,462
Digit count5
Digit sum27
Digit product2,688
Multiplicative persistence6times 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 factorisation2 × 3^2 × 43 × 113
Distinct prime factors42, 3, 43, 113
Number of divisors24
Sum of divisors σ(n)195,624
Aliquot sum108,162sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)28,224integers below n that share no factor with it
Carmichael function λ(n)336the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,224
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 43, 86, 113, 129, 226, 258, 339, 387, 678, 774, 1,017, 2,034, 4,859, 9,718, 14,577, 29,154, 43,731, 87,46224 in total
Arithmetic
Representations
Decimal87,462
Binary1010101011010011017 bits
Octal252646
Hexadecimal155A6
Base 361VHI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-seven thousand, four hundred and sixty-two
Ordinaleighty-seven thousand, four hundred and sixty-second
Scientific notation8.7462 × 10^4
Engineering notation87.462 × 10^3
In other bases
Ternary11102222100base 3; the most digit-efficient integer base after e: 11 digits
Quinary10244322base 5; one hand: 8 digits
Septenary512664base 7: 6 digits
Nonary142870base 9; each digit is two ternary digits: 6 digits
Duodecimal42746base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalaid2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:17:42base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1111000T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010101011111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010101010110100110
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 55 a6
Gray code11111111101110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010101010110100110
64-bit0000000000000000000000000000000000000000000000010101010110100110
One's complement11111111111111101010101001011001at 32 bits, every bit flipped
Bits reversed01100101101010101000000000000000at 32 bits
Rotated left by 100000000000000101010101101001100at 32 bits, wrapping
Shifted left by 1101010101101001100= 174,924, no wrap
Shifted right by 11010101011010011= 43,731, discarding the low bit
These bits as a double4.32119695 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
87,462 to the power 27,649,601,444
87,462 to the power 3669,049,441,495,128
87,462 to the power 458,516,402,252,046,885,136
87,462 to the power 55,117,961,573,768,524,667,764,832
First ten multiples87,462, 174,924, 262,386, 349,848, 437,310, 524,772, 612,234, 699,696, 787,158, 874,620
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 6
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 1120the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps87,462 → 43,731 → 131,194 → 65,597 → 196,792 → 98,396 → 49,198 → 24,599 → 73,798 → 36,899 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,746,200%
87,462% as a decimal874.62
87,462% of 10087,462
87,462% of 1,000874,620
As a fraction of 10087,462/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,462
Nerdulate something else
Nothing in mind? Surprise me · today’s page