13096
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24570
- Proper Divisor Sum (Aliquot Sum)
- 11474
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6544
- Möbius Function
- 0
- Radical
- 3274
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 57.at n=28A031555
- Number of self-avoiding closed walks from 0 of area n in strip Z X {-1,0,1}.at n=11A038578
- Interprimes which are of the form s*prime, s=8.at n=20A075283
- Numbers n such that 8*10^n + 2*R_n + 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=19A103075
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n that have k valleys at level 1.at n=49A114489
- A general recursion triangle with third part a power triangle:m=2; Power triangle: f(n,k,m)=If[n*k*(n - k) == 0, 1, n^m - (k^m + (n - k)^m)]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m*k + 1)*A(n - 1, k, m) + m*f(n, k, m)*A(n - 2, k - 1, m).at n=37A157629
- A general recursion triangle with third part a power triangle:m=2; Power triangle: f(n,k,m)=If[n*k*(n - k) == 0, 1, n^m - (k^m + (n - k)^m)]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m*k + 1)*A(n - 1, k, m) + m*f(n, k, m)*A(n - 2, k - 1, m).at n=43A157629
- Number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock singular.at n=3A184765
- Number of (n+1)X5 0..3 arrays with every 2X2 subblock singular.at n=0A184768
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock singular.at n=6A184773
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock singular.at n=9A184773
- Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined at Comments.at n=12A193007
- Numbers such that Liouville's function (A002819) and the little omega analog to Liouville's function (A174863) are equal.at n=28A224987
- Cyclops numbers whose squares are cyclops numbers.at n=15A239827
- a(n) = Sum_{k=1..n} prime(k)^2*floor(n/prime(k)) .at n=49A280385
- Numbers k such that k and k-1 both first appear in the same power of 2 (in base 10).at n=42A322919
- Triangle of coefficients in g.f. A(x,y) which satisfies: A(x,y) = Sum_{n>=0} x^n/(1 - x*y*A(x,y)^n).at n=59A340910
- Triangle of coefficients in g.f. A(x,y) which satisfies: A(x,y) = Sum_{n>=0} x^n/(1 - x*y*A(x,y)^n).at n=61A340910
- Number of integer partitions of n with all equal lengths of maximal runs of consecutive parts decreasing by 1 but not by 0.at n=46A384904
- Number of Hamiltonian paths in the n-Goldberg graph.at n=1A387457