Nerdulator> put something in

Recognised as Number

88,107

  • Positive
  • Odd
  • Composite
  • 5 digits

88,107 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value88,107
Digit count5
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3 × 43 × 683
Distinct prime factors33, 43, 683
Number of divisors8
Sum of divisors σ(n)120,384
Aliquot sum32,277sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)57,288integers below n that share no factor with it
Carmichael function λ(n)14,322the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 57,288
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 43, 129, 683, 2,049, 29,369, 88,1078 in total

Arithmetic

Previous number88,106
Next number88,108
Double176,214
Square root296.828233159≈irrational, shown to 9 decimal places
Cube root44.497622227≈
Negation-88,107
Reciprocal0.0000113498≈

Representations

Decimal88,107
Binary1010110000010101117 bits
Octal254053
Hexadecimal1582B
Base 361VZF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-eight thousand, one hundred and seven
Ordinaleighty-eight thousand, one hundred and seventh
Scientific notation8.8107 × 10^4
Engineering notation88.107 × 10^3

In other bases

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

Bit-level

00000000000000010101100000101011
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 58 2b
Gray code11111010000111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010101100000101011
64-bit0000000000000000000000000000000000000000000000010101100000101011
One's complement11111111111111101010011111010100at 32 bits, every bit flipped
Bits reversed11010100000110101000000000000000at 32 bits
Rotated left by 100000000000000101011000001010110at 32 bits, wrapping
Shifted left by 1101011000001010110= 176,214, no wrap
Shifted right by 11010110000010101= 44,053, discarding the low bit
These bits as a double4.35306419 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime88,117+10
Previous prime88,093−14
Distance to nearest prime10
Nearest square below87,616
Nearest square above88,209

Powers & multiples

88,107 to the power 27,762,843,449
88,107 to the power 3683,960,847,761,043
88,107 to the power 460,261,738,413,682,215,601
88,107 to the power 55,309,480,986,414,298,969,957,307
First ten multiples88,107, 176,214, 264,321, 352,428, 440,535, 528,642, 616,749, 704,856, 792,963, 881,070
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 171the total stopping time
Highest value reached396,4844× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps88,107 → 264,322 → 132,161 → 396,484 → 198,242 → 99,121 → 297,364 → 148,682 → 74,341 → 223,024 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,810,700%
88,107% as a decimal881.07
88,107% of 10088,107
88,107% of 1,000881,070
As a fraction of 10088,107/100

Read another way

As bytes86.042 KiB
As a 24-bit colour#01582B

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 “88107” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.