13752
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
- 24
- Divisor Sum
- 37440
- Proper Divisor Sum (Aliquot Sum)
- 23688
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4560
- Möbius Function
- 0
- Radical
- 1146
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 151
- 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(0) = 1, a(n) = 22*n^2 + 2 for n>0.at n=25A010012
- Numerators of continued fraction convergents to sqrt(572).at n=5A042096
- Row 3 of A007754.at n=22A058794
- a(n) = 24a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 24.at n=3A090732
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k U H^j Us for some j>0, where U=(1,1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=34A097777
- Determinant of n X n matrix of first n^2 squarefree numbers.at n=11A119514
- a(n) = n^3 - 3*n.at n=24A121670
- Logarithms (cf. A179989) f:{1,...,n}->Z/nZ such that either (i) n is odd or (ii) n is even and f(m) is even whenever m divides n/2.at n=25A179990
- Number of 2 X 2 nonsingular 0..n matrices with rows in increasing order.at n=11A183761
- Molecular topological indices of the sunlet graphs.at n=17A192846
- G.f.: q-sinh(x) evaluated at q=-x.at n=39A198202
- Number of (n+1) X 6 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.at n=6A207047
- Number of (n+1)X8 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=4A207049
- Number of (w,x,y) with all terms in {0,...,n} and the numbers w,x,y,|w-x|,|x-y|,|y-w| distinct.at n=27A213493
- a(n) = Sum_{i=0..n} digsum(i)^3, where digsum(i) = A007953(i).at n=38A231688
- Number of n X 3 0..1 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=5A232042
- T(n,k)=Number of nXk 0..1 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=33A232047
- Number of 6Xn 0..1 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=2A232052
- Triangle read by rows giving numbers B(n,k) arising in the enumeration of doubly rooted tree maps.at n=33A260039
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of Product_{j>=1} (1 - j*x^j)^(j^k).at n=62A294587