15485
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19680
- Proper Divisor Sum (Aliquot Sum)
- 4195
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11664
- Möbius Function
- -1
- Radical
- 15485
- Omega Function (Ω)
- 3
- 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
- 115
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Inversion of A000257.at n=7A004040
- Centered tetrahedral numbers.at n=28A005894
- Number of permutations of length n avoiding the pattern 1342.at n=8A022558
- C(2*n+4,4)-C(2*n,4).at n=14A085474
- Coefficients of the D-Dyson mod 27 identity.at n=40A104504
- Conjectured lower bound for the number of spheres of radius 1 that can be packed in a sphere of radius n.at n=26A121346
- a(n) = T(p(n)) - p(T(n)) = Commutator[triangular numbers, primes] at n.at n=47A123907
- G.f. satisfies A(x) = 1 + x + x^2*A(x)^5.at n=9A137959
- Triangle of numbers of walks in the quarter-plane, of length 2n beginning and ending at the origin using steps {(1,1), (1,0), (-1,0), (-1,-1)} (Gessel steps) arranged according to the number of times the steps (1,1) and (-1,-1) occur.at n=29A157513
- Number of ways to place 3 nonattacking nightriders on a 3 X n board.at n=16A172218
- Number of n-bead necklaces labeled with numbers -3..3 allowing reversal, with sum zero and three times sum of squares <= n*(3)*(3+1).at n=7A208800
- T(n,k) = number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero and three times sum of squares <= n*k*(k+1).at n=52A208805
- Number of permutations of 0..floor((n*7-1)/2) on even squares of an n X 7 array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.at n=5A215785
- T(n,k)=Number of permutations of 0..floor((n*k-1)/2) on even squares of an nXk array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.at n=71A215788
- Number of permutations of 0..floor((6*n-1)/2) on even squares of an 6*n array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.at n=6A215792
- Number of permutations of 0..floor((n*7-2)/2) on odd squares of an n X 7 array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=5A215867
- T(n,k) = Number of permutations of 0..floor((n*k-2)/2) on odd squares of an n X k array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=71A215870
- Number of permutations of 0..floor((6*n-2)/2) on odd squares of an 6Xn array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=6A215874
- G.f.: 1/(1 - x - x^2 - 2*x^3 - 3*x^4 - 2*x^5 - x^6).at n=13A221950
- Number of partitions p of n such that median(p) >= mean(p).at n=48A240221