Nerdulator> put something in

Number

59

  • Positive
  • Odd
  • Prime
  • 2 digits

59 is an odd 2-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 value59
Digit count2
Digit sum14
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation59
Distinct prime factors159
Number of divisors2
Sum of divisors σ(n)60
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)58integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 592 in total

Arithmetic

Previous number58
Next number60
Double118
Half29.5
Square3,481
Square root7.681145748irrational, shown to 9 decimal places
Cube root3.892996416
Negation-59
Reciprocal0.0169491525
59 factorial1386831185456898357379390197203894063459… (81 digits)

Representations

Decimal59
Binary1110116 bits
Octal73
Hexadecimal3B
Base 361N
Roman numeralLIX
In wordsfifty-nine
Ordinalfifty-ninth
Scientific notation5.9 × 10^1
Engineering notation59

Nearest landmarks

Next prime61+2
Previous prime53−6
Distance to nearest prime0, it is prime
Nearest square below49
Nearest square above64

Powers & multiples

59 to the power 23,481
59 to the power 3205,379
59 to the power 412,117,361
59 to the power 5714,924,299
First ten multiples59, 118, 177, 236, 295, 354, 413, 472, 531, 590
Powers of twoBetween 2^5 (32) and 2^6 (64)

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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 132the total stopping time
Highest value reached3045× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59 → 178 → 89 → 268 → 134 → 67 → 202 → 101 → 304 → 152 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,900%
59% as a decimal0.59
59% of 10059
59% of 1,000590
As a fraction of 10059/100

Read another way

As seconds59 seconds
As bytes59 B
As a 24-bit colour#00003B

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “59” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.