Recognised as Number

88,397

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value88,397

Digit count5

Digit sum35

Digit product12,096

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation88,397

Distinct prime factors188,397

Number of divisors2

Sum of divisors σ(n)88,398

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)88,396integers below n that share no factor with it

Carmichael function λ(n)88,396the 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,3972 in total

Arithmetic

Previous number88,396

Next number88,398

Double176,794

Half44,198.5

Square7,814,029,609

Cube690,736,775,346,773

Square root297.316329858≈irrational, shown to 9 decimal places

Cube root44.546389364≈

Negation-88,397

Reciprocal0.0000113126≈

Representations

Decimal88,397

Binary1010110010100110117 bits

Octal254515

Hexadecimal1594D

Base 361W7H

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordseighty-eight thousand, three hundred and ninety-seven

Ordinaleighty-eight thousand, three hundred and ninety-seventh

Scientific notation8.8397 × 10^4

Engineering notation88.397 × 10^3

In other bases

Ternary11111020222base 3; the most digit-efficient integer base after e: 11 digits

Quinary10312042base 5; one hand: 8 digits

Septenary515501base 7: 6 digits

Nonary144228base 9; each digit is two ternary digits: 6 digits

Duodecimal431a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimalb0jhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal24:33:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary111111T100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1101010100101011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010101100101001101

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 4d

Gray code11111010111101011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010101100101001101

64-bit0000000000000000000000000000000000000000000000010101100101001101

One's complement11111111111111101010011010110010at 32 bits, every bit flipped

Bits reversed10110010100110101000000000000000at 32 bits

Rotated left by 100000000000000101011001010011010at 32 bits, wrapping

Shifted left by 1101011001010011010= 176,794, no wrap

Shifted right by 11010110010100110= 44,198, discarding the low bit

These bits as a double4.36739209 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime88,411+14

Previous prime88,379−18

Distance to nearest prime0, it is prime

Nearest square below88,209

Nearest square above88,804

Powers & multiples

88,397 to the power 27,814,029,609

88,397 to the power 3690,736,775,346,773

88,397 to the power 461,059,058,730,328,692,881

88,397 to the power 55,397,437,614,584,865,464,601,757

First ten multiples88,397, 176,794, 265,191, 353,588, 441,985, 530,382, 618,779, 707,176, 795,573, 883,970

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 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 171the total stopping time

Highest value reached265,1923× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps88,397 → 265,192 → 132,596 → 66,298 → 33,149 → 99,448 → 49,724 → 24,862 → 12,431 → 37,294 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,839,700%

88,397% as a decimal883.97

88,397% of 10088,397

88,397% of 1,000883,970

As a fraction of 10088,397/100

Read another way

As seconds1 day, 33 minutes and 17 seconds

As bytes86.325 KiB

As a 24-bit colour#01594D

Keep nerding

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