15352
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30600
- Proper Divisor Sum (Aliquot Sum)
- 15248
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7200
- Möbius Function
- 0
- Radical
- 3838
- Omega Function (Ω)
- 5
- 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
- 133
- 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
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers).at n=39A024588
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (composite numbers).at n=38A025102
- a(n) = 3*a(n-1) - a(n-2) + 8 with a(0)=1, a(1)=11.at n=8A056124
- Sequence of sums based on primes = 7 mod 8.at n=27A060108
- Centered 17-gonal numbers: (17*n^2 - 17*n + 2)/2.at n=42A069130
- a(n) = 49n^2 - 28n - 20.at n=17A118058
- Number of base 22 circular n-digit numbers with adjacent digits differing by 5 or less.at n=4A125385
- a(n) = 14*a(n-1) - 44*a(n-2) for n > 1; a(0) = 2, a(1) = 19.at n=4A163067
- Partial sums of primes of form n^2 + (n+1)^2 + (n+2)^2 (A027864).at n=7A248373
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 371", based on the 5-celled von Neumann neighborhood.at n=27A271456
- a(n) = Sum_{k>=1} H_n(k-1)/2^k, where H_n(x) is n-th Hermite polynomial.at n=5A277380
- Number of maximal matchings in the 2 X n rook graph.at n=7A281433
- Number of nX4 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1s.at n=5A295547
- Number of n X 6 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1's.at n=3A295549
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1s.at n=39A295551
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1s.at n=41A295551
- Expansion of (1/(1 - x))*Product_{k>=1} 1/(1 - k*x^k).at n=14A302830
- a(n) = floor( Sum_{k>=0} n^sqrt(k) / Gamma(sqrt(k) + 1) ), where Gamma is Euler's gamma function.at n=7A326805
- Array read by antidiagonals: T(n,m) is the number of maximal matchings in the rook graph K_n X K_m.at n=47A341847
- Array read by antidiagonals: T(n,m) is the number of maximal matchings in the rook graph K_n X K_m.at n=52A341847