60
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 168
- Proper Divisor Sum (Aliquot Sum)
- 108
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16
- Möbius Function
- 0
- Radical
- 30
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 19
- Smith Number
- no
Classification
- Natural
- yes
- Even
- yes
- Odd
- no
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
- yes
- Carmichael Number
- no
Names
- German
- sechzig· ordinal: sechzigste
- English
- sixty· ordinal: sixtieth
- Spanish
- sesenta· ordinal: 60º
- French
- soixante· ordinal: soixantième
- Italian
- sessanta· ordinal: 60º
- Latin
- sexaginta· ordinal: 60.
- Portuguese
- sessenta· ordinal: 60º
Appears in sequences
- Euler totient function phi(n): count numbers <= n and prime to n.at n=60A000010
- Number of primitive polynomials of degree n over GF(2) (version 2).at n=9A000020
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=59A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=59A000027
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=28A000028
- Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n.at n=9A000031
- Numbers that are not squares (or, the nonsquares).at n=52A000037
- Generalized tangent numbers d(n,1).at n=24A000061
- Generalized tangent numbers d(n,1).at n=28A000061
- Number of positive integers <= 2^n of form x^2 + 2 y^2.at n=7A000067
- Number of transformation groups of order n.at n=37A000113
- Number of transformation groups of order n.at n=58A000113
- Number of cusps of principal congruence subgroup Gamma^{hat}(n).at n=9A000114
- Number of binary partitions: number of partitions of 2n into powers of 2.at n=10A000123
- Number of ways of writing n as a sum of 6 squares.at n=2A000141
- Coefficients of ménage hit polynomials.at n=2A000181
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=36A000202
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=23A000203
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=37A000203
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=58A000203