Nerdulator> put something in

Recognised as Number

88,327

  • Positive
  • Odd
  • Prime
  • 5 digits

88,327 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value88,327
Digit count5
Digit sum28
Digit product2,688
Multiplicative persistence6times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation88,327
Distinct prime factors188,327
Number of divisors2
Sum of divisors σ(n)88,328
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)88,326integers below n that share no factor with it
Carmichael function λ(n)88,326the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 88,3272 in total

Arithmetic

Previous number88,326
Next number88,328
Double176,654
Square root297.198586807≈irrational, shown to 9 decimal places
Cube root44.534627763≈
Negation-88,327
Reciprocal0.0000113216≈

Representations

Decimal88,327
Binary1010110010000011117 bits
Octal254407
Hexadecimal15907
Base 361W5J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-eight thousand, three hundred and twenty-seven
Ordinaleighty-eight thousand, three hundred and twenty-seventh
Scientific notation8.8327 × 10^4
Engineering notation88.327 × 10^3

In other bases

Ternary11111011101base 3; the most digit-efficient integer base after e: 11 digits
Quinary10311302base 5; one hand: 8 digits
Septenary515341base 7: 6 digits
Nonary144141base 9; each digit is two ternary digits: 6 digits
Duodecimal43147base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb0g7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:32:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11111011101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010100100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010101100100000111
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 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 59 07
Gray code11111010110000100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010101100100000111
64-bit0000000000000000000000000000000000000000000000010101100100000111
One's complement11111111111111101010011011111000at 32 bits, every bit flipped
Bits reversed11100000100110101000000000000000at 32 bits
Rotated left by 100000000000000101011001000001110at 32 bits, wrapping
Shifted left by 1101011001000001110= 176,654, no wrap
Shifted right by 11010110010000011= 44,163, discarding the low bit
These bits as a double4.36393363 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime88,337+10
Previous prime88,321−6
Distance to nearest prime0, it is prime
Nearest square below88,209
Nearest square above88,804

Powers & multiples

88,327 to the power 27,801,658,929
88,327 to the power 3689,097,128,221,783
88,327 to the power 460,865,882,044,445,427,041
88,327 to the power 55,376,100,763,339,731,234,250,407
First ten multiples88,327, 176,654, 264,981, 353,308, 441,635, 529,962, 618,289, 706,616, 794,943, 883,270
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1102the total stopping time
Highest value reached596,2126× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps88,327 → 264,982 → 132,491 → 397,474 → 198,737 → 596,212 → 298,106 → 149,053 → 447,160 → 223,580 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,832,700%
88,327% as a decimal883.27
88,327% of 10088,327
88,327% of 1,000883,270
As a fraction of 10088,327/100

Read another way

As bytes86.257 KiB
As a 24-bit colour#015907

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “88327” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.