Nerdulator> put something in

Number

53

  • Positive
  • Odd
  • Prime
  • 2 digits

53 is an odd 2-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value53
Digit count2
Digit sum8
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

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

Arithmetic

Previous number52
Next number54
Double106
Half26.5
Square2,809
Square root7.280109889irrational, shown to 9 decimal places
Cube root3.756285754
Negation-53
Reciprocal0.0188679245
53 factorial4274883284060025564298013753389399649690… (70 digits)

Representations

Decimal53
Binary1101016 bits
Octal65
Hexadecimal35
Base 361H
Roman numeralLIII
In wordsfifty-three
Ordinalfifty-third
Scientific notation5.3 × 10^1
Engineering notation53

Nearest landmarks

Next prime59+6
Previous prime47−6
Distance to nearest prime0, it is prime
Nearest square below49
Nearest square above64

Powers & multiples

53 to the power 22,809
53 to the power 3148,877
53 to the power 47,890,481
53 to the power 5418,195,493
First ten multiples53, 106, 159, 212, 265, 318, 371, 424, 477, 530
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 111the total stopping time
Highest value reached1603× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps53 → 160 → 80 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,300%
53% as a decimal0.53
53% of 10053
53% of 1,000530
As a fraction of 10053/100

Read another way

As seconds53 seconds
As bytes53 B
As a 24-bit colour#000035

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 “53” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.