63
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 104
- Proper Divisor Sum (Aliquot Sum)
- 41
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 36
- Möbius Function
- 0
- Radical
- 21
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 107
- Smith Number
- no
Classification
- Natural
- yes
- Even
- no
- Odd
- yes
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Names
- German
- dreiundsechzig· ordinal: dreiundsechzigste
- English
- sixty-three· ordinal: sixty-third
- Spanish
- sesenta y tres· ordinal: 63º
- French
- soixante-trois· ordinal: soixante-troisième
- Italian
- sessantatre· ordinal: 63º
- Latin
- sexaginta tres· ordinal: 63.
- Portuguese
- sessenta e três· ordinal: 63º
Appears in sequences
- Number of n-bead necklaces (turning over is allowed) where complements are equivalent.at n=11A000011
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=62A000027
- Numbers that are not squares (or, the nonsquares).at n=55A000037
- Number of mixed Husimi trees with n nodes; or polygonal cacti with bridges.at n=7A000083
- Number of partially ordered sets ("posets") with n unlabeled elements.at n=5A000112
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=38A000201
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=38A000202
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=31A000203
- A Beatty sequence: floor(n*(e-1)).at n=36A000210
- a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)at n=6A000225
- a(n) = 2*a(n-1) - a(n-2) + a(n-3) + 2^(n-1).at n=5A000253
- Number of certain rooted planar maps.at n=3A000259
- Remove all factors of 2 from n; or largest odd divisor of n; or odd part of n.at n=62A000265
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=26A000277
- Triangle of numbers related to triangle A049213; generalization of Stirling numbers of second kind A008277, Bessel triangle A001497.at n=26A000369
- Topswops (2): start by shuffling n cards labeled 1..n. If the top card is m, reverse the order of the top m cards. Repeat until 1 gets to the top, then stop. Suppose the whole deck is now sorted (if not, discard this case). a(n) is the maximal number of steps before 1 got to the top.at n=11A000376
- Numbers where total number of 1-bits in the exponents of their prime factorization is even; a 2-way classification of integers: complement of A000028.at n=32A000379
- Numbers of form x^2 + y^2 + 7z^2.at n=52A000394
- Numbers of form x^2 + 2y^2 + 2yz + 4z^2.at n=58A000398
- Numbers of form x^2 + y^2 + 2*z^2.at n=58A000401