15144
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 37920
- Proper Divisor Sum (Aliquot Sum)
- 22776
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 0
- Radical
- 3786
- 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
- no
- 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
- Graham-Sloane-type lower bound on the size of a ternary (n,3,5) constant-weight code.at n=16A030505
- McKay-Thompson series of class 13A for the Monster group with a(0) = -2.at n=14A034318
- McKay-Thompson series of class 13A for the Monster group with a(0) = 0.at n=14A034319
- Numbers which are the sum of their proper divisors containing the digit 5.at n=20A059464
- a(n) = 1728*n - 408.at n=8A157266
- G.f.: A(x) = exp( Sum_{n>=1} 3*A038500(n) * x^n/n ), where A038500 is the highest power of 3 dividing n.at n=32A161809
- To calculate n-th term, find all shortest common superstrings of the binary representations of all natural numbers from 1 to n, read them as numbers in base-2, and pick max.at n=12A175810
- To calculate n-th term, find all shortest common superstrings of the binary representations of all natural numbers from 1 to n, read them as numbers in base-2, and pick max.at n=13A175810
- Number of right triangles on a (n+1)X7 grid.at n=13A189811
- Number of horizontal and antidiagonal neighbor colorings of the odd squares of an nX4 array with new integer colors introduced in row major order.at n=4A216080
- T(n,k) = Number of horizontal and antidiagonal neighbor colorings of the odd squares of an n X k array with new integer colors introduced in row major order.at n=32A216084
- Number of horizontal and antidiagonal neighbor colorings of the odd squares of a 5Xn array with new integer colors introduced in row major order.at n=3A216087
- Number of horizontal and antidiagonal neighbor colorings of the even squares of an n X 4 array with new integer colors introduced in row major order.at n=4A216334
- T(n,k) = Number of horizontal and antidiagonal neighbor colorings of the even squares of an n X k array with new integer colors introduced in row major order.at n=32A216338
- Number of horizontal and antidiagonal neighbor colorings of the even squares of a 5Xn array with new integer colors introduced in row major order.at n=3A216341
- Number of ways writing n^2 as a sum of four squares: a(n) = A000118(n^2).at n=43A267326
- Number of triangular regions in a "frame" of size n X n (see Comments in A331776 for definition), divided by 4.at n=19A332595
- Triangle T(n,c) counting Motzkin Paths of length n with c sections starting with an up-step at level 0.at n=44A348869