Recognised as Number
88,529
- Positive
- Odd
- Composite
- 5 digits
88,529 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value88,529
Digit count5
Digit sum32
Digit product5,760
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 12,647
Distinct prime factors27, 12,647
Number of divisors4
Sum of divisors σ(n)101,184
Aliquot sum12,655sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)75,876integers below n that share no factor with it
Carmichael function λ(n)37,938the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 75,876
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 12,647, 88,5294 in total
Arithmetic
Representations
Decimal88,529
Binary1010110011101000117 bits
Octal254721
Hexadecimal159D1
Base 361WB5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-eight thousand, five hundred and twenty-nine
Ordinaleighty-eight thousand, five hundred and twenty-ninth
Scientific notation8.8529 × 10^4
Engineering notation88.529 × 10^3
In other bases
Ternary11111102212base 3; the most digit-efficient integer base after e: 11 digits
Quinary10313104base 5; one hand: 8 digits
Septenary516050base 7: 6 digits
Nonary144385base 9; each digit is two ternary digits: 6 digits
Duodecimal43295base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb169base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:35:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111111100TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010111011010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010101100111010001
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 59 d1
Gray code11111010100111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010101100111010001
64-bit0000000000000000000000000000000000000000000000010101100111010001
One's complement11111111111111101010011000101110at 32 bits, every bit flipped
Bits reversed10001011100110101000000000000000at 32 bits
Rotated left by 100000000000000101011001110100010at 32 bits, wrapping
Shifted left by 1101011001110100010= 177,058, no wrap
Shifted right by 11010110011101000= 44,264, discarding the low bit
These bits as a double4.37391376 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
88,529 to the power 27,837,383,841
88,529 to the power 3693,835,754,059,889
88,529 to the power 461,424,585,471,167,913,281
88,529 to the power 55,437,857,127,177,024,194,853,649
First ten multiples88,529, 177,058, 265,587, 354,116, 442,645, 531,174, 619,703, 708,232, 796,761, 885,290
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1164the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps88,529 → 265,588 → 132,794 → 66,397 → 199,192 → 99,596 → 49,798 → 24,899 → 74,698 → 37,349 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,852,900%
88,529% as a decimal885.29
88,529% of 10088,529
88,529% of 1,000885,290
As a fraction of 10088,529/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 88,529
Nerdulate something else
Nothing in mind? Surprise me · today’s page