12412
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 10268
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5936
- Möbius Function
- 0
- Radical
- 6206
- 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
- 94
- 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 labeled forests of n nodes each component of which is a path.at n=7A011800
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026907.at n=9A026916
- a(n) = n^3 + (n+1)^3 + (n+2)^3 + (n+3)^3.at n=13A027603
- Third row of Pascal-(1,2,1) array A081577.at n=14A081583
- Triangle read by rows: T(n,k) (0 <= k <= ceiling(n/2)-1) is the number of (1,0) steps at level k in all peakless Motzkin paths of length n (can be easily translated into RNA secondary structure terminology).at n=43A110237
- a(n) = A000041(n) + n*A032741(n).at n=34A168015
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^3<x^3+y^3.at n=27A211801
- Composite numbers whose sum of aliquot parts divides the sum of the aliquot parts of the numbers less than or equal to n and not relatively prime to n.at n=18A249109
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7.at n=37A252305
- Number of (2+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7.at n=7A252307
- Number of (n+2)X(2+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000101.at n=5A259995
- Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000101.at n=1A259999
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000101.at n=22A260001
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000101.at n=26A260001
- Number of distinct subsemigroups of the multiplicative semigroup of integers modulo n.at n=35A272213
- Number of palindromic compositions of n into nonprime numbers.at n=49A276421
- Numbers k such that (14*10^k - 101)/3 is prime.at n=17A284886
- Expansion of e.g.f. arcsinh(log(1 + x)).at n=9A296980
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 3 or 8 king-move adjacent elements, with upper left element zero.at n=13A304217
- Expansion of e.g.f. Product_{k>=1} (1 - x^k)^H(k), where H(k) is the k-th harmonic number.at n=7A304496