Recognised as Number

53,861

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value53,861

Digit count5

Digit sum23

Digit product720

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation53,861

Distinct prime factors153,861

Number of divisors2

Sum of divisors σ(n)53,862

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)53,860the 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, 53,8612 in total

Arithmetic

Previous number53,860

Next number53,862

Double107,722

Half26,930.5

Square2,901,007,321

Cube156,251,155,316,381

Square root232.07972768≈irrational, shown to 9 decimal places

Cube root37.765172329≈

Negation-53,861

Reciprocal0.0000185663≈

Representations

Decimal53,861

Binary110100100110010116 bits

Octal151145

HexadecimalD265

Base 3615K5

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

In wordsfifty-three thousand, eight hundred and sixty-one

Ordinalfifty-three thousand, eight hundred and sixty-first

Scientific notation5.3861 × 10^4

Engineering notation53.861 × 10^3

In other bases

Ternary2201212212base 3; the most digit-efficient integer base after e: 10 digits

Quinary3210421base 5; one hand: 7 digits

Septenary313013base 7: 6 digits

Nonary81785base 9; each digit is two ternary digits: 5 digits

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

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

Sexagesimal14:57:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1101001001100101

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 set bits, so even; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2d2 65

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

At each machine width

16-bit1101001001100101

32-bit00000000000000001101001001100101

64-bit0000000000000000000000000000000000000000000000001101001001100101

One's complement0010110110011010at 16 bits, every bit flipped

Bits reversed1010011001001011at 16 bits

Rotated left by 11010010011001011at 16 bits, wrapping

Shifted left by 111010010011001010= 107,722, no wrap

Shifted right by 1110100100110010= 26,930, discarding the low bit

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

Nearest landmarks

Next prime53,881+20

Previous prime53,857−4

Distance to nearest prime0, it is prime

Nearest square below53,824

Nearest square above54,289

Powers & multiples

53,861 to the power 22,901,007,321

53,861 to the power 3156,251,155,316,381

53,861 to the power 48,415,843,476,495,597,041

53,861 to the power 5453,285,745,487,529,352,225,301

First ten multiples53,861, 107,722, 161,583, 215,444, 269,305, 323,166, 377,027, 430,888, 484,749, 538,610

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time

Highest value reached161,5843× the starting value

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

First steps53,861 → 161,584 → 80,792 → 40,396 → 20,198 → 10,099 → 30,298 → 15,149 → 45,448 → 22,724 → …

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

As a percentage & fraction

As a percentage5,386,100%

53,861% as a decimal538.61

53,861% of 10053,861

53,861% of 1,000538,610

As a fraction of 10053,861/100

Read another way

As seconds14 hours, 57 minutes and 41 seconds

As bytes52.599 KiB

As a 24-bit colour#00D265

Keep nerding

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