12314
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19008
- Proper Divisor Sum (Aliquot Sum)
- 6694
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5980
- Möbius Function
- -1
- Radical
- 12314
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(n) = floor(tau*a(n-1)) + floor(tau*a(n-2)) with a(0)=0 and a(1)=2.at n=12A005909
- Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 5).at n=44A035553
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10^3.at n=16A127028
- Number of non-Fibonacci parts in the last section of the set of partitions of n.at n=37A144118
- n^2 + {1,3,7} are primes.at n=35A182238
- Number of partitions of n plus number of divisors of n.at n=33A195364
- Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,2,4,1 for x=0,1,2,3,4.at n=7A196451
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,0,2,4,1 for x=0,1,2,3,4.at n=47A196456
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,0,2,4,1 for x=0,1,2,3,4.at n=52A196456
- Number of nX2 0..3 arrays with every row and column running average nondecreasing rightwards and downwards.at n=5A201210
- Number of nX6 0..3 arrays with every row and column running average nondecreasing rightwards and downwards.at n=1A201214
- T(n,k)=Number of nXk 0..3 arrays with every row and column running average nondecreasing rightwards and downwards.at n=22A201216
- T(n,k)=Number of nXk 0..3 arrays with every row and column running average nondecreasing rightwards and downwards.at n=26A201216
- Number of 3X3X3 triangular 0..n arrays with no element lying outside the (possibly reversed) range delimited by its sw and se neighbors, and every horizontal row having the same average value.at n=18A214541
- a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=2, a(1)=1, a(2)=2.at n=16A214899
- Number of partially ordered partitions of n into parts less than or equal to 3, in which the order of adjacent 2's and 3's is unimportant.at n=17A254685
- a(n) = 48*2^n + 26 (n>=1).at n=7A304605
- Number of finite sequences of positive integers whose sum minus runs-resistance is n.at n=9A329768
- Number of even-length compositions of n with alternating parts distinct.at n=19A342532
- Triangle read by rows: T(n, k) is the number of permutations of size n that require exactly k iterations of the pop-stack sorting map to reach the identity, for n >= 1, 0 <= k <= n-1.at n=33A359413