Recognised as Number
88,332
- Positive
- Even
- Composite
- 5 digits
88,332 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value88,332
Digit count5
Digit sum24
Digit product1,152
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 17 × 433
Distinct prime factors42, 3, 17, 433
Number of divisors24
Sum of divisors σ(n)218,736
Aliquot sum130,404sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)27,648integers below n that share no factor with it
Carmichael function λ(n)432the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,648
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 17, 34, 51, 68, 102, 204, 433, 866, 1,299, 1,732, 2,598, 5,196, 7,361, 14,722, 22,083, 29,444, 44,166, 88,33224 in total
Arithmetic
Representations
Decimal88,332
Binary1010110010000110017 bits
Octal254414
Hexadecimal1590C
Base 361W5O
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-eight thousand, three hundred and thirty-two
Ordinaleighty-eight thousand, three hundred and thirty-second
Scientific notation8.8332 × 10^4
Engineering notation88.332 × 10^3
In other bases
Ternary11111011120base 3; the most digit-efficient integer base after e: 11 digits
Quinary10311312base 5; one hand: 8 digits
Septenary515346base 7: 6 digits
Nonary144146base 9; each digit is two ternary digits: 6 digits
Duodecimal43150base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb0gcbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:32:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111111TTTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010100100011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010101100100001100
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 set bits, so odd; 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 59 0c
Gray code11111010110001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010101100100001100
64-bit0000000000000000000000000000000000000000000000010101100100001100
One's complement11111111111111101010011011110011at 32 bits, every bit flipped
Bits reversed00110000100110101000000000000000at 32 bits
Rotated left by 100000000000000101011001000011000at 32 bits, wrapping
Shifted left by 1101011001000011000= 176,664, no wrap
Shifted right by 11010110010000110= 44,166, discarding the low bit
These bits as a double4.36418066 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
88,332 to the power 27,802,542,224
88,332 to the power 3689,214,159,730,368
88,332 to the power 460,879,665,157,302,866,176
88,332 to the power 55,377,622,582,674,876,775,058,432
First ten multiples88,332, 176,664, 264,996, 353,328, 441,660, 529,992, 618,324, 706,656, 794,988, 883,320
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12Yes
Divisible by 100No, remainder 32
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,332 → 44,166 → 22,083 → 66,250 → 33,125 → 99,376 → 49,688 → 24,844 → 12,422 → 6,211 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,833,200%
88,332% as a decimal883.32
88,332% of 10088,332
88,332% of 1,000883,320
As a fraction of 10088,332/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,332
Nerdulate something else
Nothing in mind? Surprise me · today’s page