Recognised as Number

10,861

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value10,861

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation10,861

Distinct prime factors110,861

Number of divisors2

Sum of divisors σ(n)10,862

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number10,860

Next number10,862

Double21,722

Half5,430.5

Square117,961,321

Cube1,281,177,907,381

Square root104.216121594≈irrational, shown to 9 decimal places

Cube root22.145726797≈

Negation-10,861

Reciprocal0.0000920726≈

Representations

Decimal10,861

Binary1010100110110114 bits

Octal25155

Hexadecimal2A6D

Base 368DP

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

In wordsten thousand, eight hundred and sixty-one

Ordinalten thousand, eight hundred and sixty-first

Scientific notation1.0861 × 10^4

Engineering notation10.861 × 10^3

In other bases

Ternary112220021base 3; the most digit-efficient integer base after e: 9 digits

Quinary321421base 5; one hand: 6 digits

Septenary43444base 7: 5 digits

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

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

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

Sexagesimal3:1:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0010101001101101

Bit length14 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes22a 6d

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

At each machine width

16-bit0010101001101101

32-bit00000000000000000010101001101101

64-bit0000000000000000000000000000000000000000000000000010101001101101

One's complement1101010110010010at 16 bits, every bit flipped

Bits reversed1011011001010100at 16 bits

Rotated left by 10101010011011010at 16 bits, wrapping

Shifted left by 1101010011011010= 21,722, no wrap

Shifted right by 11010100110110= 5,430, discarding the low bit

These bits as a double5.36604698 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime10,867+6

Previous prime10,859−2

Distance to nearest prime0, it is prime

Nearest square below10,816

Nearest square above11,025

Powers & multiples

10,861 to the power 2117,961,321

10,861 to the power 31,281,177,907,381

10,861 to the power 413,914,873,252,065,041

10,861 to the power 5151,129,438,390,678,410,301

First ten multiples10,861, 21,722, 32,583, 43,444, 54,305, 65,166, 76,027, 86,888, 97,749, 108,610

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 199the total stopping time

Highest value reached223,07220× the starting value

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

First steps10,861 → 32,584 → 16,292 → 8,146 → 4,073 → 12,220 → 6,110 → 3,055 → 9,166 → 4,583 → …

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

As a percentage & fraction

As a percentage1,086,100%

10,861% as a decimal108.61

10,861% of 10010,861

10,861% of 1,000108,610

As a fraction of 10010,861/100

Read another way

As seconds3 hours, 1 minute and 1 second

As bytes10.606 KiB

As a 24-bit colour#002A6D

Keep nerding

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