62
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 96
- Proper Divisor Sum (Aliquot Sum)
- 34
- 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
- 30
- Möbius Function
- 1
- Radical
- 62
- Omega Function (Ω)
- 2
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 107
- Smith Number
- no
Classification
- Natural
- yes
- Even
- yes
- Odd
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- zweiundsechzig· ordinal: zweiundsechzigste
- English
- sixty-two· ordinal: sixty-second
- Spanish
- sesenta y dos· ordinal: 62º
- French
- soixante-deux· ordinal: soixante-deuxième
- Italian
- sessantadue· ordinal: 62º
- Latin
- sexaginta duo· ordinal: 62.
- Portuguese
- sessenta e dois· ordinal: 62º
Appears in sequences
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=61A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=61A000027
- Numbers that are not squares (or, the nonsquares).at n=54A000037
- Number of primitive n-bead necklaces (turning over is allowed) where complements are equivalent.at n=11A000046
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=44A000062
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=11A000064
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=31A000069
- Number of transformation groups of order n.at n=60A000113
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=19A000134
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=60A000203
- Number of partitions into non-integral powers.at n=5A000327
- Sums of three squares: numbers of the form x^2 + y^2 + z^2.at n=53A000378
- 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=31A000379
- Numbers of form x^2 + y^2 + 7z^2.at n=51A000394
- Numbers of form x^2 + 2y^2 + 2yz + 4z^2.at n=57A000398
- Numbers that are the sum of three nonzero squares.at n=37A000408
- Numbers that are the sum of 4 nonzero squares.at n=46A000414
- Numbers that are the sum of 3 but no fewer nonzero squares.at n=24A000419
- The greedy sequence of integers which avoids 3-term geometric progressions.at n=46A000452
- 1 together with products of 2 or more distinct primes.at n=20A000469