15864
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 39720
- Proper Divisor Sum (Aliquot Sum)
- 23856
- 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
- 3966
- Omega Function (Ω)
- 5
- 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
- 53
- 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
- Number of 4-covers of an unlabeled n-set.at n=8A005784
- Numbers k such that k | sigma_11(k).at n=32A055715
- Numbers n such that 3^n + 2^(n-1) is prime.at n=40A082103
- Indices of primes in sequence defined by A(0) = 23, A(n) = 10*A(n-1) + 53 for n > 0.at n=11A101970
- Numbers k such that k and 5*k, taken together, are pandigital.at n=8A115925
- Let f(z) = z^2 + c, then row k lists the expansion of the n-fold composition f(f(...f(0)...)) in rising powers of c.at n=52A137560
- a(n) = 441*n^2 - 2*n.at n=5A157737
- Triangle by rows, related to the numbers of binary trees of height less than n, derived from the Mandelbrot set.at n=48A202019
- (1/2)*A206803.at n=33A206804
- a(n) = r * (n-1)! where r is the rational number that satisfies the equation Sum_{k>=n} (-1)^(k + n)/C(k,n) = n*2^(n-1)*log(2) - r.at n=5A242091
- Number of length n+6 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=36A255997
- Numbers n such that n^3+prime(n) and n^3-prime(n) are prime.at n=37A257788
- Sum over all partitions of n of the GCD of the number of parts and the number of distinct parts.at n=32A339312
- Triangle read by rows: T(n,k) is the number of ordered partitions of [n] into k nonempty subsets, in which the first subset has size at least 2, n >= 1 and 1 <= k <= n.at n=38A348576
- Irregular triangular array read by rows. T(n,k) is the number of n X n Boolean relation matrices whose row span is k, n >= 0, 1 <= k <= 2^n.at n=19A362943
- Triangle read by rows: T(n,k) is the number of distinct tuples E each corresponding to some k-ary word W = (w_1, ..., w_n), where E is a tuple (e_1, ..., e_{n-1}) with e_i being the number of pairs of equal letters (w_j,w_k) in W such that j + i = k.at n=53A381349