Recognised as Number

83,215

Positive
Odd
Composite
5 digits

83,215 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value83,215

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 factorisation5 × 11 × 17 × 89

Distinct prime factors45, 11, 17, 89

Number of divisors16

Sum of divisors σ(n)116,640

Aliquot sum33,425sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)880the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 56,320

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 11, 17, 55, 85, 89, 187, 445, 935, 979, 1,513, 4,895, 7,565, 16,643, 83,21516 in total

Arithmetic

Previous number83,214

Next number83,216

Double166,430

Half41,607.5

Square6,924,736,225

Cube576,241,924,963,375

Square root288.470102437≈irrational, shown to 9 decimal places

Cube root43.658338705≈

Negation-83,215

Reciprocal0.0000120171≈

Representations

Decimal83,215

Binary1010001010000111117 bits

Octal242417

Hexadecimal1450F

Base 361S7J

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

In wordseighty-three thousand, two hundred and fifteen

Ordinaleighty-three thousand, two hundred and fifteenth

Scientific notation8.3215 × 10^4

Engineering notation83.215 × 10^3

In other bases

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

Quinary10130330base 5; one hand: 8 digits

Septenary464416base 7: 6 digits

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

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

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

Sexagesimal23:6:55base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010100010100001111

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 45 0f

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

At each machine width

32-bit00000000000000010100010100001111

64-bit0000000000000000000000000000000000000000000000010100010100001111

One's complement11111111111111101011101011110000at 32 bits, every bit flipped

Bits reversed11110000101000101000000000000000at 32 bits

Rotated left by 100000000000000101000101000011110at 32 bits, wrapping

Shifted left by 1101000101000011110= 166,430, no wrap

Shifted right by 11010001010000111= 41,607, discarding the low bit

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

Nearest landmarks

Next prime83,219+4

Previous prime83,207−8

Distance to nearest prime4

Nearest square below82,944

Nearest square above83,521

Powers & multiples

83,215 to the power 26,924,736,225

83,215 to the power 3576,241,924,963,375

83,215 to the power 447,951,971,785,827,250,625

83,215 to the power 53,990,323,332,157,614,660,759,375

First ten multiples83,215, 166,430, 249,645, 332,860, 416,075, 499,290, 582,505, 665,720, 748,935, 832,150

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 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11Yes

Divisible by 12No, remainder 7

Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 1151the total stopping time

Highest value reached842,56010× the starting value

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

First steps83,215 → 249,646 → 124,823 → 374,470 → 187,235 → 561,706 → 280,853 → 842,560 → 421,280 → 210,640 → …

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

As a percentage & fraction

As a percentage8,321,500%

83,215% as a decimal832.15

83,215% of 10083,215

83,215% of 1,000832,150

As a fraction of 10083,215/100

Read another way

As seconds23 hours, 6 minutes and 55 seconds

As bytes81.265 KiB

As a 24-bit colour#01450F

Keep nerding

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