13514
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21060
- Proper Divisor Sum (Aliquot Sum)
- 7546
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6496
- Möbius Function
- -1
- Radical
- 13514
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of days in n years (n=4 is the first leap year).at n=36A033171
- Number of days in n years (n=3 is the first leap year).at n=36A033172
- Number of days in n years (n=2 is the first leap year).at n=36A033173
- Values of A038007 not ending in 6 or 8.at n=26A038009
- Number of elements e in all partitions of n such that e divides n.at n=25A089251
- A symmetrical recursion triangular sequence: m=4; e(n,k,m)= (2* k + m - 1)e(n - 1, k, m) + (m*n - 2*k + 1 - m)e(n - 1, k - 1, m); t(n,k)=e(n, k, m) + e(n, n - k, m).at n=22A156233
- A symmetrical recursion triangular sequence: m=4; e(n,k,m)= (2* k + m - 1)e(n - 1, k, m) + (m*n - 2*k + 1 - m)e(n - 1, k - 1, m); t(n,k)=e(n, k, m) + e(n, n - k, m).at n=26A156233
- a(n) = 16*n^2 + 2*n.at n=28A158056
- Numbers of the form prime(n)*(prime(n)-1)/4.at n=22A171555
- Least k > 1 such that the product pen(n) * pen(k) is pentagonal, or zero if no such k exists, where pen(k) is the k-th pentagonal number.at n=34A212615
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 33", based on the 5-celled von Neumann neighborhood.at n=27A269812
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 542", based on the 5-celled von Neumann neighborhood.at n=33A272811
- Number of toroidal necklaces of size n whose entries cover an initial interval of positive integers.at n=6A323870
- Numbers whose multiset multisystem (A302242) is crossing.at n=36A324170
- a(n) is the number of integers that can be represented in a 7-segment display by using only n segments (version A277116).at n=19A350440