1314
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 2886
- Proper Divisor Sum (Aliquot Sum)
- 1572
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 432
- Möbius Function
- 0
- Radical
- 438
- 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
- 52
- 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
- a(n) = n concatenated with n + 1.at n=12A001704
- Number of nonisomorphic solutions to minimal independent dominating set on queens' graph Q(n).at n=14A002567
- Number of bipartite partitions.at n=8A002764
- Number of ways writing 2^n as unordered sums of 2 primes.at n=18A006307
- Cald's sequence: a(n+1) = a(n) - prime(n) if that value is positive and new, otherwise a(n) + prime(n) if new, otherwise 0; start with a(1)=1.at n=124A006509
- a(n) = n*(4*n+1).at n=18A007742
- Number of non-Abelian metacyclic groups of order 2^n.at n=34A007982
- Coordination sequence T2 for Zeolite Code ATT.at n=26A008042
- Coordination sequence T8 for Zeolite Code MFI.at n=23A008171
- Continued fraction for cube root of 90.at n=12A010318
- Numbers k such that k divides 2^(k+1) - 2.at n=15A014741
- Numbers k that divide s(k), where s(1)=1, s(j)=18*s(j-1)+j.at n=33A014868
- Numbers k such that phi(k) | sigma(k + 6).at n=55A015844
- Positive integers n such that n | (2^n + n/2 - 1).at n=13A015942
- Expansion of 1/(1-x^9-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17-x^18-x^19).at n=53A017886
- Expansion of 1/((1-x)*(1-2*x)*(1-5*x)*(1-7*x)).at n=3A021124
- a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=1 a(2)=3; where c( ) is complement of a( ).at n=45A022947
- a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=2, a(2)=3; where c( ) is complement of a( ).at n=45A022951
- a(n+1) = a(n) converted to base 10 from base 6 (written in base 10).at n=8A023387
- Convolution of A023532 and composite numbers.at n=45A023599