13552
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
- 2
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 32984
- Proper Divisor Sum (Aliquot Sum)
- 19432
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 0
- Radical
- 154
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- a(n) = T(2n-1,n-2), T given by A027157.at n=5A027162
- Expansion of (theta_3(z)*theta_3(19z) + theta_2(z)*theta_2(19z))^4.at n=26A028644
- a(n) = 7*n^2.at n=44A033582
- Sort-then-add sequence: a(1) = 316, a(n+1) = a(n) + sort(a(n)).at n=10A033861
- Number of partitions in parts not of the form 25k, 25k+1 or 25k-1. Also number of partitions with no part of size 1 and differences between parts at distance 11 are greater than 1.at n=44A036000
- Number of ordered factorizations with 2 levels of parentheses indexed by prime signatures.at n=22A050357
- a(n) = 28*n^2.at n=22A064763
- Nonsquares which are the product of two numbers with the same digits (leading zeros are forbidden).at n=39A072443
- Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n.at n=5A074053
- Numbers n such that the digital binary sum of n equals core(n), the squarefree part of n.at n=39A077476
- Expansion of 1/((1-x)^2*(1-x^2)^2*(1-x^3)).at n=40A097701
- a(n) = Sum_{k=1..n} k*(prime(k) - k).at n=20A110477
- Let P be Pascal's triangle A007318 and let N be Narayana's triangle A001263, both regarded as lower triangular matrices. Sequence gives triangle obtained from P*N, read by rows.at n=39A126182
- Number of intersections of at least four edges in a cube of n X n X n smaller cubes.at n=22A126562
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k UU's (doublerises) (n >= 1; 0 <= k <= n-1).at n=41A128718
- n*[n/2]*[n/3], where [] = floor.at n=44A213033
- Number of all possible tetrahedra of any size and orientation, formed when intersecting the original regular tetrahedron by planes parallel to its sides and dividing its edges into n equal parts.at n=20A216173
- Semiperimeters s of primitive Pythagorean triples (a, b, c) where a, b, c and s are not squarefree.at n=27A237620
- Union of all unique coefficients of all powers of the g.f. A(x) of this sequence, starting with A(0)=2 and A'(0)=3.at n=62A262975
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 363", based on the 5-celled von Neumann neighborhood.at n=6A268153