Nerdulator> put something in

Number

63

  • Positive
  • Odd
  • Composite
  • 2 digits

63 is an odd 2-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value63
Digit count2
Digit sum9
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7
Distinct prime factors23, 7
Number of divisors6
Sum of divisors σ(n)104
Aliquot sum41sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)36integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 636 in total

Arithmetic

Previous number62
Next number64
Double126
Half31.5
Square3,969
Square root7.937253933irrational, shown to 9 decimal places
Cube root3.979057208
Negation-63
Reciprocal0.0158730159
63 factorial1982608315404440064116146708361898137544… (88 digits)

Representations

Decimal63
Binary1111116 bits
Octal77
Hexadecimal3F
Base 361R
Roman numeralLXIII
In wordssixty-three
Ordinalsixty-third
Scientific notation6.3 × 10^1
Engineering notation63

Nearest landmarks

Next prime67+4
Previous prime61−2
Distance to nearest prime2
Nearest square below49
Nearest square above64

Powers & multiples

63 to the power 23,969
63 to the power 3250,047
63 to the power 415,752,961
63 to the power 5992,436,543
First ten multiples63, 126, 189, 252, 315, 378, 441, 504, 567, 630
Powers of twoBetween 2^5 (32) and 2^6 (64)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 63

Collatz (3n + 1) trajectory

Steps to reach 1107the total stopping time
Highest value reached9,232146× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps63 → 190 → 95 → 286 → 143 → 430 → 215 → 646 → 323 → 970 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,300%
63% as a decimal0.63
63% of 10063
63% of 1,000630
As a fraction of 10063/100

Read another way

As bytes63 B
As a 24-bit colour#00003F

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