15150
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
- 24
- Divisor Sum
- 37944
- Proper Divisor Sum (Aliquot Sum)
- 22794
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4000
- Möbius Function
- 0
- Radical
- 3030
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 84
- 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
- Card matching: coefficients B[n,1] of t in the reduced hit polynomial A[n,n,n](t).at n=4A000279
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10).at n=46A017841
- Positive numbers k such that k and 3*k are anagrams in base 7 (written in base 7).at n=21A023069
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or is not a Lucas number).at n=17A023497
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or 2 or is not a Fibonacci number).at n=17A023498
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=18A023501
- Numbers n such that n | 4^n + 3^n + 2^n + 1^n.at n=28A056643
- Card-matching numbers (Dinner-Diner matching numbers).at n=19A059062
- Card-matching numbers (Dinner-Diner matching numbers).at n=36A059066
- Inverse Moebius transform of Lucas numbers (A000032).at n=20A108031
- Number of labeled digraphs without isolated vertices and with n arcs.at n=4A121252
- A factorial-Pascal matrix.at n=59A162747
- A factorial-Pascal matrix.at n=61A162747
- The sum of the elements within a jump in a Sieve of Eratosthenes table.at n=25A179545
- a(n) = [x^n/n!] (1/x) * log( (n+1 - n*exp(x)) / (n+2 - (n+1)*exp(x)) ).at n=4A201732
- Number of (w,x,y,z) with all terms in {1,...,n} and 2|w-x|>n+|y-z|.at n=19A212689
- Majority value maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and vertical neighbors in a random 0..2 nX3 array.at n=4A220256
- Majority value maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and vertical neighbors in a random 0..2 nX5 array.at n=2A220258
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and vertical neighbors in a random 0..2 nXk array.at n=23A220259
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and vertical neighbors in a random 0..2 nXk array.at n=25A220259