Recognised as Number

59,085

Positive
Odd
Composite
5 digits

59,085 is an odd 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value59,085

Digit count5

Digit sum27

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5 × 13 × 101

Distinct prime factors43, 5, 13, 101

Number of divisors24

Sum of divisors σ(n)111,384

Aliquot sum52,299sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)300the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,800

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 9, 13, 15, 39, 45, 65, 101, 117, 195, 303, 505, 585, 909, 1,313, 1,515, 3,939, 4,545, 6,565, 11,817, 19,695, 59,08524 in total

Arithmetic

Previous number59,084

Next number59,086

Double118,170

Half29,542.5

Square3,491,037,225

Cube206,267,934,439,125

Square root243.074062787≈irrational, shown to 9 decimal places

Cube root38.948650369≈

Negation-59,085

Reciprocal0.0000169248≈

Representations

Decimal59,085

Binary111001101100110116 bits

Octal163315

HexadecimalE6CD

Base 3619L9

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

In wordsfifty-nine thousand and eighty-five

Ordinalfifty-nine thousand and eighty-fifth

Scientific notation5.9085 × 10^4

Engineering notation59.085 × 10^3

In other bases

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

Quinary3342320base 5; one hand: 7 digits

Septenary334155base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110011011001101

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Bytes2e6 cd

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

At each machine width

16-bit1110011011001101

32-bit00000000000000001110011011001101

64-bit0000000000000000000000000000000000000000000000001110011011001101

One's complement0001100100110010at 16 bits, every bit flipped

Bits reversed1011001101100111at 16 bits

Rotated left by 11100110110011011at 16 bits, wrapping

Shifted left by 111100110110011010= 118,170, no wrap

Shifted right by 1111001101100110= 29,542, discarding the low bit

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

Nearest landmarks

Next prime59,093+8

Previous prime59,083−2

Distance to nearest prime2

Nearest square below59,049

Nearest square above59,536

Powers & multiples

59,085 to the power 23,491,037,225

59,085 to the power 3206,267,934,439,125

59,085 to the power 412,187,340,906,335,700,625

59,085 to the power 5720,089,037,450,844,871,428,125

First ten multiples59,085, 118,170, 177,255, 236,340, 295,425, 354,510, 413,595, 472,680, 531,765, 590,850

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 5

Divisible by 11No, remainder 4

Divisible by 12No, remainder 9

Divisible by 100No, remainder 85

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time

Highest value reached177,2563× the starting value

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

First steps59,085 → 177,256 → 88,628 → 44,314 → 22,157 → 66,472 → 33,236 → 16,618 → 8,309 → 24,928 → …

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

As a percentage & fraction

As a percentage5,908,500%

59,085% as a decimal590.85

59,085% of 10059,085

59,085% of 1,000590,850

As a fraction of 10059,085/100

Read another way

As seconds16 hours, 24 minutes and 45 seconds

As bytes57.7 KiB

As a 24-bit colour#00E6CD

Keep nerding

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