Recognised as Number

60,859

Positive
Odd
Prime
5 digits

60,859 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 value60,859

Digit count5

Digit sum28

Digit product0zero, because one of the digits is zero

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

Distinct prime factors160,859

Number of divisors2

Sum of divisors σ(n)60,860

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number60,858

Next number60,860

Double121,718

Half30,429.5

Square3,703,817,881

Cube225,410,652,419,779

Square root246.696169407≈irrational, shown to 9 decimal places

Cube root39.334618044≈

Negation-60,859

Reciprocal0.0000164314≈

Representations

Decimal60,859

Binary111011011011101116 bits

Octal166673

HexadecimalEDBB

Base 361AYJ

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

In wordssixty thousand, eight hundred and fifty-nine

Ordinalsixty thousand, eight hundred and fifty-ninth

Scientific notation6.0859 × 10^4

Engineering notation60.859 × 10^3

In other bases

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

Quinary3421414base 5; one hand: 7 digits

Septenary342301base 7: 6 digits

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

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

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

Sexagesimal16:54:19base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110110110111011

Bit length16 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits4within that length

Bit parityeven12 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

Bytes2ed bb

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

At each machine width

16-bit1110110110111011

32-bit00000000000000001110110110111011

64-bit0000000000000000000000000000000000000000000000001110110110111011

One's complement0001001001000100at 16 bits, every bit flipped

Bits reversed1101110110110111at 16 bits

Rotated left by 11101101101110111at 16 bits, wrapping

Shifted left by 111101101101110110= 121,718, no wrap

Shifted right by 1111011011011101= 30,429, discarding the low bit

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

Nearest landmarks

Next prime60,869+10

Previous prime60,821−38

Distance to nearest prime0, it is prime

Nearest square below60,516

Nearest square above61,009

Powers & multiples

60,859 to the power 23,703,817,881

60,859 to the power 3225,410,652,419,779

60,859 to the power 413,718,266,895,615,330,161

60,859 to the power 5834,880,005,000,253,378,268,299

First ten multiples60,859, 121,718, 182,577, 243,436, 304,295, 365,154, 426,013, 486,872, 547,731, 608,590

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 7

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time

Highest value reached308,1045× the starting value

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

First steps60,859 → 182,578 → 91,289 → 273,868 → 136,934 → 68,467 → 205,402 → 102,701 → 308,104 → 154,052 → …

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

As a percentage & fraction

As a percentage6,085,900%

60,859% as a decimal608.59

60,859% of 10060,859

60,859% of 1,000608,590

As a fraction of 10060,859/100

Read another way

As seconds16 hours, 54 minutes and 19 seconds

As bytes59.433 KiB

As a 24-bit colour#00EDBB

Keep nerding

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