12172
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 10508
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5696
- Möbius Function
- 0
- Radical
- 6086
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 112
- Smith Number
- no
- Vampire Number
- 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
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of triangle-free graphs on n vertices.at n=9A006785
- a(n) = n^3 + 5.at n=23A084381
- Number of permutations of length n which avoid the patterns 1432, 2134, 2143.at n=8A116809
- Multiples of 17 containing a 17 in their decimal representation.at n=26A121037
- Expansion of 1/(x^k*(1-x-3*x^(k+1))) for k=6.at n=25A143457
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k columns with an even sum (0<=k<=floor(n/2)).at n=30A181327
- Number of 2-compositions of n having no column with an even sum. A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=10A181329
- Triangle T(n,k), n>=0, 0<=k<=C(n,2), read by rows: T(n,k) = number of k-length saturated chains in the poset of Dyck paths of semilength n ordered by inclusion.at n=31A193536
- a(n) is the smallest integer that is the sum of n distinct terms of A075058.at n=13A202618
- Number of partitions of n containing at least one part m-7 if m is the largest part.at n=33A212547
- Number of strict trees of weight 2n + 1 in which all outdegrees and all leaves are odd.at n=19A300797