13662
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 34560
- Proper Divisor Sum (Aliquot Sum)
- 20898
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3960
- Möbius Function
- 0
- Radical
- 1518
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 45
- Smith Number
- yes
- 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
- Number of partitions of n into Fibonacci parts (with 2 types of 1).at n=40A007000
- Numbers whose base-7 representation contains exactly four 5's.at n=9A043416
- Bessel function J_0(n) is a monotonically decreasing positive sequence.at n=28A046960
- a(n) = n*(n+1)*(2*n+1)*(n^2+n+3)/30.at n=11A061927
- Add column entries of the table with rows (1,2,0,0...), (0,3,4,5,0,0...), (0,0,6,7,8,9,0,0...), (0,0,0,10,11,12,13,14,0,0...), ...at n=43A064694
- Triangle read by rows: T(n,k) is the number of even trees with 2n edges and jump-length equal to k (0<=k<=n-1).at n=32A127535
- a(n) = (1/2)*(n^4 + 11*n^3 + 53*n^2 + 97*n + 54).at n=11A129026
- Numbers n = concat(a,b) such that phi(n) = phi(a) * phi(b), where phi = A000010.at n=24A147619
- a(n) = n*(2*n^2 + 5*n + 15)/2.at n=23A163673
- a(n) = n^3 mod (n-th prime squared).at n=30A167623
- 1/128 the number of (n+2)X(n+2) binary arrays with no 3X3 subblock trace equal to any horizontal or vertical neighbor 3X3 subblock trace.at n=2A185857
- 1/128 the number of (n+2)X5 binary arrays with no 3X3 subblock trace equal to any horizontal or vertical neighbor 3X3 subblock trace.at n=2A185860
- T(n,k)=1/128 the number of (n+2)X(k+2) binary arrays with no 3X3 subblock trace equal to any horizontal or vertical neighbor 3X3 subblock trace.at n=12A185866
- Number of terms of 2^j + 3^k <= 10^n.at n=43A219835
- a(n) = n*(7*n^2 + 15*n + 8)/6.at n=22A245301
- Indices of primes in the tetranacci sequence A001631.at n=11A247027
- Number of length 3+2 0..n arrays with the sum of second differences multiplied by some arrangement of +-1 equal to zero.at n=8A250562
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 262", based on the 5-celled von Neumann neighborhood.at n=45A271067
- a(n) = 12*n^2 + 18*n.at n=33A277980
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation.at n=35A295622