10
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 1
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18
- Proper Divisor Sum (Aliquot Sum)
- 8
- 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
- 4
- Möbius Function
- 1
- Radical
- 10
- 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
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 6
- 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
- yes
- Carmichael Number
- no
Names
- German
- zehn· ordinal: zehnte
- English
- ten· ordinal: tenth
- Spanish
- diez· ordinal: décimo
- French
- dix· ordinal: dixième
- Italian
- dieci· ordinal: decimo
- Latin
- decem· ordinal: decimus
- Portuguese
- dez· ordinal: décimo
Appears in sequences
- Number of groups of order n.at n=90A000001
- Number of classes of primitive positive definite binary quadratic forms of discriminant D = -4n; or equivalently the class number of the quadratic order of discriminant D = -4n.at n=73A000003
- Number of classes of primitive positive definite binary quadratic forms of discriminant D = -4n; or equivalently the class number of the quadratic order of discriminant D = -4n.at n=85A000003
- d(n) (also called tau(n) or sigma_0(n)), the number of divisors of n.at n=47A000005
- d(n) (also called tau(n) or sigma_0(n)), the number of divisors of n.at n=79A000005
- Integer part of square root of n-th prime.at n=25A000006
- Integer part of square root of n-th prime.at n=26A000006
- Integer part of square root of n-th prime.at n=27A000006
- Integer part of square root of n-th prime.at n=28A000006
- Integer part of square root of n-th prime.at n=29A000006
- Expansion of Product_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts.at n=10A000009
- Euler totient function phi(n): count numbers <= n and prime to n.at n=10A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=21A000010
- Definition (1): Number of n-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed.at n=7A000013
- Number of series-reduced trees with n nodes.at n=10A000014
- a(n) is the number of distinct (infinite) output sequences from binary n-stage shift register which feeds back the complement of the last stage.at n=7A000016
- Number of primitive permutation groups of degree n.at n=16A000019
- Number of primitive permutation groups of degree n.at n=40A000019
- Number of primitive permutation groups of degree n.at n=42A000019
- Number of primitive permutation groups of degree n.at n=66A000019