1393
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1600
- Proper Divisor Sum (Aliquot Sum)
- 207
- 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
- 1188
- Möbius Function
- 1
- Radical
- 1393
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of E.g.f. exp(-x)/(1-3x).at n=4A000180
- Number of partitions of n, with three kinds of 1,2,3 and 4 and two kinds of 5,6,7,...at n=9A000711
- Sum of odd Fermat coefficients rounded to nearest integer.at n=10A000968
- a(n+1) = n*a(n) + a(n-1) with a(0)=0, a(1)=1.at n=7A001040
- a(n) is the solution to the postage stamp problem with n denominations and 5 stamps.at n=10A001215
- Pell-Lucas numbers: numerators of continued fraction convergents to sqrt(2).at n=9A001333
- Genus of modular group Gamma(n) = genus of modular curve Chi(n).at n=33A001767
- NSW numbers: a(n) = 6*a(n-1) - a(n-2); also a(n)^2 - 2*b(n)^2 = -1 with b(n) = A001653(n+1).at n=4A002315
- Interleave denominators (A000129) and numerators (A001333) of convergents to sqrt(2).at n=19A002965
- Numbers which are the sum of 3 nonzero 4th powers.at n=37A003337
- Sums of distinct nonzero 4th powers.at n=37A003999
- a(n) = floor(Fibonacci(n)/3).at n=19A004696
- a(n) = floor(n*phi^11), where phi is the golden ratio, A001622.at n=7A004926
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=7A004946
- a(n) = (n+2)*a(n-1) + (-1)^n.at n=5A006348
- Numerator of Sum_{k=1..4} k^(-4).at n=2A007410
- Number of nodes in regular n-gon with all diagonals drawn.at n=15A007569
- Number of non-Abelian metacyclic groups of order p^n (p odd).at n=42A007983
- Coordination sequence T3 for Zeolite Code NES.at n=24A008207
- cos(cos(x)*arcsin(x))=1-1/2!*x^2+9/4!*x^4-105/6!*x^6+1393/8!*x^8...at n=4A012485