Recognised as Number
83,888
- Positive
- Even
- Composite
- 5 digits
83,888 is an even 5-digit integer and a composite number. It has 30 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value83,888
Digit count5
Digit sum35
Digit product12,288
Multiplicative persistence4times 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 factorisation2^4 × 7^2 × 107
Distinct prime factors32, 7, 107
Number of divisors30
Sum of divisors σ(n)190,836
Aliquot sum106,948sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)35,616integers below n that share no factor with it
Carmichael function λ(n)4,452the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 35,616
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 16, 28, 49, 56, 98, 107, 112, 196, 214, 392, 428, 749, 784, 856, 1,498, 1,712, 2,996, 5,243, 5,992, 10,486, 11,984, 20,972, 41,944, 83,88830 in total
Arithmetic
Representations
Decimal83,888
Binary1010001111011000017 bits
Octal243660
Hexadecimal147B0
Base 361SQ8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-three thousand, eight hundred and eighty-eight
Ordinaleighty-three thousand, eight hundred and eighty-eighth
Scientific notation8.3888 × 10^4
Engineering notation83.888 × 10^3
In other bases
Ternary11021001222base 3; the most digit-efficient integer base after e: 11 digits
Quinary10141023base 5; one hand: 8 digits
Septenary466400base 7: 6 digits
Nonary137058base 9; each digit is two ternary digits: 6 digits
Duodecimal40668base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala9e8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:18:8base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T101T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101100011110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100011110110000
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes301 47 b0
Gray code11110010001101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100011110110000
64-bit0000000000000000000000000000000000000000000000010100011110110000
One's complement11111111111111101011100001001111at 32 bits, every bit flipped
Bits reversed00001101111000101000000000000000at 32 bits
Rotated left by 100000000000000101000111101100000at 32 bits, wrapping
Shifted left by 1101000111101100000= 167,776, no wrap
Shifted right by 11010001111011000= 41,944, discarding the low bit
These bits as a double4.14461789 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
83,888 to the power 27,037,196,544
83,888 to the power 3590,336,343,683,072
83,888 to the power 449,522,135,198,885,543,936
83,888 to the power 54,154,312,877,564,110,509,703,168
First ten multiples83,888, 167,776, 251,664, 335,552, 419,440, 503,328, 587,216, 671,104, 754,992, 838,880
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 8
Divisible by 11No, remainder 2
Divisible by 12No, remainder 8
Divisible by 100No, remainder 88
Collatz (3n + 1) trajectory
Steps to reach 158the total stopping time
Highest value reached83,888
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps83,888 → 41,944 → 20,972 → 10,486 → 5,243 → 15,730 → 7,865 → 23,596 → 11,798 → 5,899 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,388,800%
83,888% as a decimal838.88
83,888% of 10083,888
83,888% of 1,000838,880
As a fraction of 10083,888/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 83,888
Nerdulate something else
Nothing in mind? Surprise me · today’s page