Recognised as Number

10,859

Positive
Odd
Prime
5 digits

10,859 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 value10,859

Digit count5

Digit sum23

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation10,859

Distinct prime factors110,859

Number of divisors2

Sum of divisors σ(n)10,860

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number10,858

Next number10,860

Double21,718

Half5,429.5

Square117,917,881

Cube1,280,470,269,779

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

Cube root22.144367371≈

Negation-10,859

Reciprocal0.0000920895≈

Representations

Decimal10,859

Binary1010100110101114 bits

Octal25153

Hexadecimal2A6B

Base 368DN

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

In wordsten thousand, eight hundred and fifty-nine

Ordinalten thousand, eight hundred and fifty-ninth

Scientific notation1.0859 × 10^4

Engineering notation10.859 × 10^3

In other bases

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

Quinary321414base 5; one hand: 6 digits

Septenary43442base 7: 5 digits

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

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

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

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

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

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

Bit-level

0010101001101011

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 6b

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

At each machine width

16-bit0010101001101011

32-bit00000000000000000010101001101011

64-bit0000000000000000000000000000000000000000000000000010101001101011

One's complement1101010110010100at 16 bits, every bit flipped

Bits reversed1101011001010100at 16 bits

Rotated left by 10101010011010110at 16 bits, wrapping

Shifted left by 1101010011010110= 21,718, no wrap

Shifted right by 11010100110101= 5,429, discarding the low bit

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

Nearest landmarks

Next prime10,861+2

Previous prime10,853−6

Distance to nearest prime0, it is prime

Nearest square below10,816

Nearest square above11,025

Powers & multiples

10,859 to the power 2117,917,881

10,859 to the power 31,280,470,269,779

10,859 to the power 413,904,626,659,530,161

10,859 to the power 5150,990,340,895,838,018,299

First ten multiples10,859, 21,718, 32,577, 43,436, 54,295, 65,154, 76,013, 86,872, 97,731, 108,590

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11No, remainder 2

Divisible by 12No, remainder 11

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time

Highest value reached48,8684× the starting value

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

First steps10,859 → 32,578 → 16,289 → 48,868 → 24,434 → 12,217 → 36,652 → 18,326 → 9,163 → 27,490 → …

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

As a percentage & fraction

As a percentage1,085,900%

10,859% as a decimal108.59

10,859% of 10010,859

10,859% of 1,000108,590

As a fraction of 10010,859/100

Read another way

As seconds3 hours and 59 seconds

As bytes10.604 KiB

As a 24-bit colour#002A6B

Keep nerding

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