15542
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24600
- Proper Divisor Sum (Aliquot Sum)
- 9058
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7344
- Möbius Function
- -1
- Radical
- 15542
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of n with equal number of parts congruent to each of 1, 2, 3 and 4 (mod 5).at n=65A046775
- Number of basic blocks of size 5xn for tilings with square tiles of size up to 5 X 5.at n=14A054858
- Matrix inverse of triangle A101275 (number of Schröder paths).at n=38A102051
- Column 2 of triangle A102051, which is the matrix inverse of triangle A101275 (number of Schroeder paths).at n=6A102053
- Numbers which are the sum of two positive cubes and divisible by 19.at n=37A102619
- Twice 13-gonal numbers: a(n) = n*(11*n - 9).at n=38A152997
- a(n) = 9*n^2 - 8*n + 2.at n=42A154254
- a(n) = n*(2*n^2 + 5*n + 1).at n=19A163832
- Number of partitions of 5n with equal number of parts congruent to each of 1, 2, 3 and 4 modulo 5.at n=13A202192
- a(n) = 7*n^2 + 2*n - 15.at n=46A239796
- Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k ascents. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. An ascent is a maximal sequence of consecutive (1,1)-steps.at n=42A246186
- Convolution of Lucas and Jacobsthal numbers.at n=13A264038
- Even numbers k such that A103230(k) is a perfect square.at n=37A332531