Nerdulator> put something in

Recognised as Number

82,883

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value82,883
Digit count5
Digit sum29
Digit product3,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation82,883
Distinct prime factors182,883
Number of divisors2
Sum of divisors σ(n)82,884
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)82,882integers below n that share no factor with it
Carmichael function λ(n)82,882the 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, 82,8832 in total

Arithmetic

Previous number82,882
Next number82,884
Double165,766
Square root287.894077744≈irrational, shown to 9 decimal places
Cube root43.600200599≈
Negation-82,883
Reciprocal0.0000120652≈

Representations

Decimal82,883
Binary1010000111100001117 bits
Octal241703
Hexadecimal143C3
Base 361RYB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-two thousand, eight hundred and eighty-three
Ordinaleighty-two thousand, eight hundred and eighty-third
Scientific notation8.2883 × 10^4
Engineering notation82.883 × 10^3

In other bases

Ternary11012200202base 3; the most digit-efficient integer base after e: 11 digits
Quinary10123013base 5; one hand: 8 digits
Septenary463433base 7: 6 digits
Nonary135622base 9; each digit is two ternary digits: 6 digits
Duodecimal3bb6bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala743base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:1:23base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T0T01T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100010011000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010100001111000011
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 43 c3
Gray code11110001000100010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010100001111000011
64-bit0000000000000000000000000000000000000000000000010100001111000011
One's complement11111111111111101011110000111100at 32 bits, every bit flipped
Bits reversed11000011110000101000000000000000at 32 bits
Rotated left by 100000000000000101000011110000110at 32 bits, wrapping
Shifted left by 1101000011110000110= 165,766, no wrap
Shifted right by 11010000111100001= 41,441, discarding the low bit
These bits as a double4.09496429 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime82,889+6
Previous prime82,847−36
Distance to nearest prime0, it is prime
Nearest square below82,369
Nearest square above82,944

Powers & multiples

82,883 to the power 26,869,591,689
82,883 to the power 3569,372,367,959,387
82,883 to the power 447,191,289,973,577,872,721
82,883 to the power 53,911,355,686,880,054,824,734,643
First ten multiples82,883, 165,766, 248,649, 331,532, 414,415, 497,298, 580,181, 663,064, 745,947, 828,830
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 83

Collatz (3n + 1) trajectory

Steps to reach 158the total stopping time
Highest value reached372,9764× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps82,883 → 248,650 → 124,325 → 372,976 → 186,488 → 93,244 → 46,622 → 23,311 → 69,934 → 34,967 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,288,300%
82,883% as a decimal828.83
82,883% of 10082,883
82,883% of 1,000828,830
As a fraction of 10082,883/100

Read another way

As bytes80.94 KiB
As a 24-bit colour#0143C3

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