15495
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
- 8
- Divisor Sum
- 24816
- Proper Divisor Sum (Aliquot Sum)
- 9321
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8256
- Möbius Function
- -1
- Radical
- 15495
- 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
- sinh(sin(x)-tan(x))=-3/3!*x^3-15/5!*x^5-273/7!*x^7-15495/9!*x^9...at n=3A013356
- Number of 2's in n-th term of A007651.at n=38A022467
- Expansion of Product_{m>=1} (1-m*q^m)^25.at n=5A022685
- a(n) is the least k such that the n-almost prime count is positive and equal to the (n-1)-almost prime count. a(0) = 1.at n=3A125149
- 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, 0, 0), (0, -1, 0), (0, 1, -1), (1, 1, 1)}.at n=8A149599
- Coefficients in the expansion of C^5/B^6, in Watson's notation of page 118.at n=8A160533
- Number of nX4 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=5A207496
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=41A207500
- Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=3A207503
- Number of boundary guillotine partitions of a 3-dimensional box obtained with n cuts.at n=6A220875
- Sum of the odd singletons in all partitions of n (n>=0). A singleton in a partition is a part that occurs exactly once.at n=26A276423
- Numbers k such that 2*10^k - 69 is prime.at n=16A290033
- Number of subsets of {1..n} whose sum of squares of elements is a square.at n=20A336815
- Numbers k such that k and k + 1 are both lazy-Lucas-Niven numbers (A351719).at n=33A351720
- Expansion of g.f. A(x) satisfying 0 = Sum_{n>=0} (-1)^n * x^(n*(n-1)/2) * A(x)^(n*(n+1)/2) / Product_{k=2..n+2} (1 - x^k*A(x)^(k+1)).at n=8A363555