Recognised as Number

82,351

Positive
Odd
Prime
5 digits

82,351 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 value82,351

Digit count5

Digit sum19

Digit product240

Multiplicative persistence2times 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 factorisation82,351

Distinct prime factors182,351

Number of divisors2

Sum of divisors σ(n)82,352

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)82,350the 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,3512 in total

Arithmetic

Previous number82,350

Next number82,352

Double164,702

Half41,175.5

Square6,781,687,201

Cube558,478,722,689,551

Square root286.968639402≈irrational, shown to 9 decimal places

Cube root43.506714954≈

Negation-82,351

Reciprocal0.0000121431≈

Representations

Decimal82,351

Binary1010000011010111117 bits

Octal240657

Hexadecimal141AF

Base 361RJJ

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

In wordseighty-two thousand, three hundred and fifty-one

Ordinaleighty-two thousand, three hundred and fifty-first

Scientific notation8.2351 × 10^4

Engineering notation82.351 × 10^3

In other bases

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

Quinary10113401base 5; one hand: 8 digits

Septenary462043base 7: 6 digits

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

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

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

Sexagesimal22:52:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010100000110101111

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 41 af

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

At each machine width

32-bit00000000000000010100000110101111

64-bit0000000000000000000000000000000000000000000000010100000110101111

One's complement11111111111111101011111001010000at 32 bits, every bit flipped

Bits reversed11110101100000101000000000000000at 32 bits

Rotated left by 100000000000000101000001101011110at 32 bits, wrapping

Shifted left by 1101000001101011110= 164,702, no wrap

Shifted right by 11010000011010111= 41,175, discarding the low bit

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

Nearest landmarks

Next prime82,361+10

Previous prime82,349−2

Distance to nearest prime0, it is prime

Nearest square below81,796

Nearest square above82,369

Powers & multiples

82,351 to the power 26,781,687,201

82,351 to the power 3558,478,722,689,551

82,351 to the power 445,991,281,292,207,214,401

82,351 to the power 53,787,428,005,694,556,313,136,751

First ten multiples82,351, 164,702, 247,053, 329,404, 411,755, 494,106, 576,457, 658,808, 741,159, 823,510

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 7

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1151the total stopping time

Highest value reached833,81210× the starting value

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

First steps82,351 → 247,054 → 123,527 → 370,582 → 185,291 → 555,874 → 277,937 → 833,812 → 416,906 → 208,453 → …

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

As a percentage & fraction

As a percentage8,235,100%

82,351% as a decimal823.51

82,351% of 10082,351

82,351% of 1,000823,510

As a fraction of 10082,351/100

Read another way

As seconds22 hours, 52 minutes and 31 seconds

As bytes80.421 KiB

As a 24-bit colour#0141AF

Keep nerding

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