15424
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
- 14
- Divisor Sum
- 30734
- Proper Divisor Sum (Aliquot Sum)
- 15310
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7680
- Möbius Function
- 0
- Radical
- 482
- Omega Function (Ω)
- 7
- 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
- 27
- 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
- Expansion of Jacobi theta constant (theta_2/2)^16.at n=6A014805
- Generalized sum of divisors function: third diagonal of A060047.at n=33A060046
- Number of closed Knight's tours on a 3 X 2n board.at n=7A070030
- Numbers n > 1 such that n^5 - 2 has no prime factor > n.at n=3A083955
- Numbers in A086473 corresponding to the unique product of two numbers having the unique sum of A086533.at n=12A086860
- Total number of permutations p of [n] such that |p(i+3) - p(i)| is not equal to 3 for 1 <= i <= n-3.at n=8A117574
- a(n) = ceiling(Sum_{i=1..n-1} a(i)/4) for n >= 2 starting with a(1) = 1.at n=46A120160
- a(n) = (1/n) * Sum_{d|n} phi(n/d)*2^(d+1).at n=16A161219
- Number of closed Knight's tours on a 3 X n board.at n=15A169764
- Number of line segments connecting exactly 8 points in an n x n grid of points.at n=38A177724
- T(n,k) = number of n-step one or two space at a time rook's tours on a k X k board summed over all starting positions.at n=41A187286
- Number of 6-step one or two space at a time rook's tours on an n X n board summed over all starting positions.at n=3A187291
- T(n,k) = Number of n-turn bishop's tours on a k X k board summed over all starting positions.at n=48A188777
- Number of 4-turn bishop's tours on an n X n board summed over all starting positions.at n=6A188779
- Potential magic constants of 8 X 8 magic squares composed of consecutive primes.at n=33A189188
- Antidiagonal sums of the convolution array A213590.at n=10A213557
- E.g.f. A(x) satisfies A(x) = 1 + A(x)^4 * Integral 1/A(x)^4 dx.at n=5A234294
- a(n) = Sum_{k=0..n} C(n + 2*k, 3*k) * C(3*k, 2*k).at n=5A243116
- Number of binary toroidal necklaces of size n.at n=17A323859
- Number of subsets of {1..n} of which every subset has a different sum.at n=24A325864