Recognised as Number
98,588
- Positive
- Even
- Composite
- 5 digits
98,588 is an even 5-digit integer and a composite number. It has 18 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value98,588
Digit count5
Digit sum38
Digit product23,040
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 7^2 × 503
Distinct prime factors32, 7, 503
Number of divisors18
Sum of divisors σ(n)201,096
Aliquot sum102,508sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)42,168integers below n that share no factor with it
Carmichael function λ(n)10,542the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 42,168
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 14, 28, 49, 98, 196, 503, 1,006, 2,012, 3,521, 7,042, 14,084, 24,647, 49,294, 98,58818 in total
Arithmetic
Representations
Decimal98,588
Binary1100000010001110017 bits
Octal300434
Hexadecimal1811C
Base 36242K
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-eight thousand, five hundred and eighty-eight
Ordinalninety-eight thousand, five hundred and eighty-eighth
Scientific notation9.8588 × 10^4
Engineering notation98.588 × 10^3
In other bases
Ternary12000020102base 3; the most digit-efficient integer base after e: 11 digits
Quinary11123323base 5; one hand: 8 digits
Septenary560300base 7: 6 digits
Nonary160212base 9; each digit is two ternary digits: 6 digits
Duodecimal49078base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc698base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:23:8base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT0001T011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000000101101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000011000000100011100
Bit length17 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits11within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes301 81 1c
Gray code10100000110010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000011000000100011100
64-bit0000000000000000000000000000000000000000000000011000000100011100
One's complement11111111111111100111111011100011at 32 bits, every bit flipped
Bits reversed00111000100000011000000000000000at 32 bits
Rotated left by 100000000000000110000001000111000at 32 bits, wrapping
Shifted left by 1110000001000111000= 197,176, no wrap
Shifted right by 11100000010001110= 49,294, discarding the low bit
These bits as a double4.87089439 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
98,588 to the power 29,719,593,744
98,588 to the power 3958,235,308,033,472
98,588 to the power 494,470,502,548,403,937,536
98,588 to the power 59,313,657,905,242,047,393,799,168
First ten multiples98,588, 197,176, 295,764, 394,352, 492,940, 591,528, 690,116, 788,704, 887,292, 985,880
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 6
Divisible by 12No, remainder 8
Divisible by 100No, remainder 88
Collatz (3n + 1) trajectory
Steps to reach 1221the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps98,588 → 49,294 → 24,647 → 73,942 → 36,971 → 110,914 → 55,457 → 166,372 → 83,186 → 41,593 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,858,800%
98,588% as a decimal985.88
98,588% of 10098,588
98,588% of 1,000985,880
As a fraction of 10098,588/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 98,588
Nerdulate something else
Nothing in mind? Surprise me · today’s page