13264
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 25730
- Proper Divisor Sum (Aliquot Sum)
- 12466
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6624
- Möbius Function
- 0
- Radical
- 1658
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 94
- 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
- -sinh(sin(x)-arcsin(x))=2/3!*x^3+8/5!*x^5+226/7!*x^7+13264/9!*x^9...at n=3A013347
- Indices of prime values of heptanacci-Lucas numbers A104621.at n=35A104622
- Minimal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=41A110611
- Triangular array read by rows. T(n,k) is the number of n-permutations that have at least k fixed points with n >= 1 and 1 <= k <= n.at n=49A208956
- Number of pairs of functions f, g from a size n set into itself satisfying f(f(g(x))) = f(f(x)).at n=4A239775
- Numbers of n-length words on alphabet {0,1,...,6} with no subwords ii, where i is from {0,1,2}.at n=5A254601
- a(n) is the smallest number of grains of sand placed at the center square of a (2n-1) X (2n-1) table so that some grains drop off the table by the end of the diffusion process.at n=42A259013
- Number of binary strings of length n that avoid the pattern x x^R x (x^R is the reversal of x).at n=29A261204
- Positive integers m such that pi(k^3) + pi(m^3) is a cube for some k = 1,...,m, where pi(x) denotes the number of primes not exceeding x.at n=19A262698
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 595", based on the 5-celled von Neumann neighborhood.at n=23A273142
- Expansion of e.g.f. Product_{k>0} 1/(1-tan(x)^k).at n=6A335627
- Number of proper 5-partitions of the fan graph on n vertices such that every triangle uses exactly 2 colors.at n=7A390131