15466
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27360
- Proper Divisor Sum (Aliquot Sum)
- 11894
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6480
- Möbius Function
- 1
- Radical
- 15466
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 27
- 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
- Coefficient of q^(2n-1) in the series expansion of Ramanujan's mock theta function f(q).at n=48A000199
- Conjectured number of irreducible multiple zeta values of depth 9 and weight 2n+25.at n=13A022497
- Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n-1} k^2.at n=19A050410
- Truncated triangular pyramid numbers: a(n) = Sum_{k=9..n} (k*(k+1)/2 - 45).at n=37A051943
- Let r, s, t be three permutations of the set {1,2,3,..,n}; a(n) = value of Sum_{i=1..n} r(i)*s(i)*t(i), with r={1,2,3,..,n}; s={n,n-1,..,1} and t={n,n-2,n-4,...,1,...,n-3,n-1}.at n=20A070893
- Expansion of (1+x+x^2)/((1+x^2)*(1+x)^4*(1-x)^5).at n=40A082290
- Number of permutations p of (1,2,3,...,n) such that k+p(k) is a triangular number for 1<=k<=n.at n=22A096901
- a(n) = Sum_{k=0..floor(n/2)} (n-k)^2.at n=37A129371
- a(n) = first term that can be reduced in n steps via repeated interpretation of a(n) as a base b+1 number where b is the largest digit of a(n), such that b is always 6 so that each interpretation is base 7. Terms already fully reduced (i.e., single digits) are excluded.at n=5A141840
- a(n) = 11*n*(n+1).at n=37A164136
- Irregular triangle read by rows: T(n,k) is the number of sensed 3-connected planar maps with n >= 4 faces and k >= 4 vertices.at n=45A239893
- Expansion of f(-x^2, -x^10) / f(-x, -x) in powers of x where f(, ) is Ramanujan's general theta function.at n=26A262984
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 206", based on the 5-celled von Neumann neighborhood.at n=36A270735
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 413", based on the 5-celled von Neumann neighborhood.at n=27A272009
- a(n) is the number of symmetric permutations (p(1),p(2),...,p(m)) of (1,2,...,m), m=2n or m=2n+1, with p(m+1-k) = m+1-p(k) for 1<=k<=m, such that adjacent numbers do not differ by 1. a(n) is also the number of point-symmetric arrangements of m non-attacking kings on an m X m board, with one in each row and column.at n=6A283184
- Maximum value of the cyclic convolution of the first n positive integers with themselves.at n=36A294172
- G.f. A(x) satisfies: Sum_{n>=0} x^n * A(x)^(n^2) = Sum_{n>=0} x^(n^2).at n=10A325218
- Number of non-isomorphic twice-balanced multiset partitions of weight n.at n=12A340652
- Array read by antidiagonals: T(n,k) is the number of noncrossing k-gonal cacti with n polygons up to rotation.at n=52A361236
- Number of nonequivalent noncrossing triangular cacti with n triangles up to rotation.at n=7A361237