Recognised as Number

83,557

Positive
Odd
Prime
5 digits

83,557 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 value83,557

Digit count5

Digit sum28

Digit product4,200

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation83,557

Distinct prime factors183,557

Number of divisors2

Sum of divisors σ(n)83,558

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)83,556the 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, 83,5572 in total

Arithmetic

Previous number83,556

Next number83,558

Double167,114

Half41,778.5

Square6,981,772,249

Cube583,375,943,809,693

Square root289.062277027≈irrational, shown to 9 decimal places

Cube root43.718066493≈

Negation-83,557

Reciprocal0.0000119679≈

Representations

Decimal83,557

Binary1010001100110010117 bits

Octal243145

Hexadecimal14665

Base 361SH1

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

In wordseighty-three thousand, five hundred and fifty-seven

Ordinaleighty-three thousand, five hundred and fifty-seventh

Scientific notation8.3557 × 10^4

Engineering notation83.557 × 10^3

In other bases

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

Quinary10133212base 5; one hand: 8 digits

Septenary465415base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010100011001100101

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 46 65

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

At each machine width

32-bit00000000000000010100011001100101

64-bit0000000000000000000000000000000000000000000000010100011001100101

One's complement11111111111111101011100110011010at 32 bits, every bit flipped

Bits reversed10100110011000101000000000000000at 32 bits

Rotated left by 100000000000000101000110011001010at 32 bits, wrapping

Shifted left by 1101000110011001010= 167,114, no wrap

Shifted right by 11010001100110010= 41,778, discarding the low bit

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

Nearest landmarks

Next prime83,561+4

Previous prime83,537−20

Distance to nearest prime0, it is prime

Nearest square below83,521

Nearest square above84,100

Powers & multiples

83,557 to the power 26,981,772,249

83,557 to the power 3583,375,943,809,693

83,557 to the power 448,745,143,736,906,518,001

83,557 to the power 54,072,997,975,224,697,924,609,557

First ten multiples83,557, 167,114, 250,671, 334,228, 417,785, 501,342, 584,899, 668,456, 752,013, 835,570

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time

Highest value reached250,6723× the starting value

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

First steps83,557 → 250,672 → 125,336 → 62,668 → 31,334 → 15,667 → 47,002 → 23,501 → 70,504 → 35,252 → …

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

As a percentage & fraction

As a percentage8,355,700%

83,557% as a decimal835.57

83,557% of 10083,557

83,557% of 1,000835,570

As a fraction of 10083,557/100

Read another way

As seconds23 hours, 12 minutes and 37 seconds

As bytes81.599 KiB

As a 24-bit colour#014665

Keep nerding

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