1364
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 2688
- Proper Divisor Sum (Aliquot Sum)
- 1324
- 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
- 600
- Möbius Function
- 0
- Radical
- 682
- 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
- yes
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 13
- 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
- Lucas numbers (beginning with 1): L(n) = L(n-1) + L(n-2) with L(1) = 1, L(2) = 3.at n=14A000204
- Associated Mersenne numbers.at n=15A001350
- A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=15A001638
- a(n) = 11*a(n-1) + a(n-2).at n=3A001946
- A generalized partition function.at n=14A002598
- Bisection of Lucas sequence: a(n) = L(2*n+1).at n=7A002878
- Numbers k such that k and k+1 have same sum of divisors.at n=4A002961
- Numbers that are the sum of 6 positive 5th powers.at n=36A003351
- a(n) = floor(n*phi^7), where phi is the golden ratio, A001622.at n=47A004922
- a(n) = floor(n*phi^15), where phi is the golden ratio, A001622.at n=1A004930
- a(n) = round(n*phi^15), where phi is the golden ratio, A001622.at n=1A004950
- a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=15A005013
- Number of permutations of [n] with at least one strong fixed point (a permutation p of {1,2,...,n} is said to have j as a strong fixed point if p(k) < j for k < j and p(k) > j for k > j).at n=6A006932
- Coordination sequence T3 for Zeolite Code AFR.at n=28A008021
- Coordination sequence T5 for Zeolite Code HEU.at n=24A008120
- Coordination sequence T2 for Zeolite Code MFS.at n=23A008174
- Coordination sequence T8 for Zeolite Code PAU.at n=27A008226
- If a, b in sequence, so is ab+4.at n=27A009303
- Expansion of e.g.f.: sin(tanh(log(1+x))).at n=7A009519
- a(n) = floor(n*(n-1)*(n-2)/24).at n=33A011842