15452
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
- 6
- Divisor Sum
- 27048
- Proper Divisor Sum (Aliquot Sum)
- 11596
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7724
- Möbius Function
- 0
- Radical
- 7726
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 146
- 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
- Triangle read by rows: T(n,k) is the number of Delannoy paths of length n, having k EE's and NN's crossing the line y = x (i.e., two consecutive E steps from the line y = x+1 to the line y = x-1 or two consecutive N steps from the line y = x-1 to the line y = x+1).at n=32A110123
- Triangle read by rows: number of Dyck paths of semilength n having k 3-bridges of a given shape (0<=k<=floor(n/3)). A 3-bridge is a subpath of the form UUUDDD or UUDUDD starting at level 0.at n=22A114499
- Number of Dyck paths of semilength n having no UUUDDD's starting at level zero; here U=(1,1), D=(1,-1). Also number of Dyck paths of semilength n having no UUDUDD's starting at level zero.at n=10A114500
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 2.at n=32A209984
- Number of ways to reciprocally link elements of an n X n array either to themselves or to exactly two horizontal, vertical or antidiagonal neighbors.at n=3A220682
- Number of ways to reciprocally link elements of an nX4 array either to themselves or to exactly two horizontal, vertical or antidiagonal neighbors.at n=3A220684
- T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal, vertical or antidiagonal neighbors.at n=24A220688
- a(0)=0; thereafter a(n) = A238824(n-1)+A238825(n).at n=13A238828
- a(n) = floor((10*n^3 + 63*n^2 + 126*n + 89) / 72).at n=46A254874
- Number of perfect cube parts in all partitions of n.at n=28A264392
- Number of binary min-heaps on n elements from the set {0,1} that give a max-heap when reversed.at n=33A379272
- 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 A384145.at n=61A384652