15240
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 46080
- Proper Divisor Sum (Aliquot Sum)
- 30840
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 3810
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- Partial sums of A011863.at n=15A011888
- a(n) = Sum_{k=1..n} floor(k^4/n).at n=15A014819
- Triangle of partial row sums of triangle A054446(n,m), n >= m >= 0.at n=57A054448
- McKay-Thompson series of class 24F for Monster.at n=27A058576
- McKay-Thompson series of class 24d for Monster.at n=54A058587
- a(n) = ((5^n mod 4^n) mod 3^n) mod 2^n.at n=13A064854
- Pascal-(1,6,1) array.at n=58A081581
- Pascal-(1,6,1) array.at n=62A081581
- Triangle read by rows: T(n,k) is the number of ordered trees with n edges and k branches.at n=62A091187
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k peaks at even height.at n=58A091869
- Triangle read by rows: a(n,k) = C(n,k)*(2^(n-k) - 1) for k<n, a(n,k) = 0 for k >= n, where k=0..max(n-1,0).at n=49A091913
- Coefficients of replicable function number 24e.at n=54A112163
- Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H steps (0<=k<=floor(n/2)).at n=52A132280
- Triangle read by rows. T(n, k) = binomial(n, k)*(2^k - 1 + 0^k).at n=62A134319
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 0, 1), (0, 0, 1), (1, 1, 0)}.at n=8A150130
- Totally multiplicative sequence with a(p) = a(p-1) + 7 for prime p.at n=41A166704
- Smallest number k such that prime(n) divides the n-th divisor of k.at n=29A226101
- a(n) = n! + (2*n-1)!/(n-1)!.at n=4A226730
- Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=22A253218
- 29-gonal pyramidal numbers: a(n) = n*(n+1)*(9*n-8)/2.at n=15A256649