15543
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24648
- Proper Divisor Sum (Aliquot Sum)
- 9105
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9360
- Möbius Function
- 0
- Radical
- 5181
- Omega Function (Ω)
- 4
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n into parts not of the form 25k, 25k+7 or 25k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=36A036006
- Values of A038005 ending in 3.at n=16A038013
- Positions of 5-digit terms in the continued fraction for Pi (3 is position 0).at n=1A048961
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1.at n=18A096024
- Number of primes between (prime(n + 1))^Pi and (prime(n))^Pi.at n=32A137380
- a(n) = (n^3 - n + 9)/3.at n=35A155753
- Triangle read by rows: T(n,k) = number of n-element unlabeled N-free posets of height k (1 <= k <= n).at n=50A202181
- Partial sums of A247666.at n=50A253767
- Number of nX3 0..2 arrays with no element unequal to more than four of its king-move neighbors and with new values introduced in order 0 sequentially upwards.at n=4A282052
- Number of nX5 0..2 arrays with no element unequal to more than four of its king-move neighbors and with new values introduced in order 0 sequentially upwards.at n=2A282054
- T(n,k) = Number of n X k 0..2 arrays with no element unequal to more than four of its king-move neighbors and with new values introduced in order 0 sequentially upwards.at n=23A282056
- T(n,k) = Number of n X k 0..2 arrays with no element unequal to more than four of its king-move neighbors and with new values introduced in order 0 sequentially upwards.at n=25A282056
- Number of nX3 0..1 arrays with every element equal to 0, 1, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=11A299189
- Sum of the second largest parts in the partitions of n into 6 parts.at n=39A308872
- G.f. A(x) satisfies A(x) = 1 + (x * (1+x))^3 * A(x)^2.at n=17A378153
- Numerators of rational coefficients which are ratio of Brent's coefficients -A[n,2]/A343480.at n=17A380947
- Order 3 perimeter magic squares of magic sum n, all elements distinct and 1 in the set; bracelet symmetry.at n=37A382455
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A382450.at n=41A384777