13052
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24696
- Proper Divisor Sum (Aliquot Sum)
- 11644
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6000
- Möbius Function
- 0
- Radical
- 6526
- 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
- 76
- 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
- Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives k values.at n=12A053019
- Numbers k such that k^6 == 1 (mod 7^4).at n=31A056092
- Numbers k such that the largest prime factor of k is equal to the sum of primes dividing k+1 (with repetition).at n=16A071861
- Sum of next n even interprimes.at n=13A075675
- a(n) = 4 + 8*n + 10*n^2 + 4*n^3.at n=14A100207
- G.f.: A(x) = exp( Sum_{n>=1} A162552(n) * 2*A006519(n) * x^n/n ).at n=29A161803
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two consecutive zero elements.at n=12A199531
- Number of nX6 0..2 arrays with diagonals and antidiagonals unimodal and rows nondecreasing.at n=2A224351
- T(n,k)=Number of nXk 0..2 arrays with diagonals and antidiagonals unimodal and rows nondecreasing.at n=30A224353
- Number of 3 X n 0..2 arrays with diagonals and antidiagonals unimodal and rows nondecreasing.at n=5A224354
- Number of (n+1)X(5+1) 0..1 arrays with no 2X2 subblock having x11-x00 less than x10-x01.at n=2A251265
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having x11-x00 less than x10-x01.at n=23A251268
- Number of (3+1) X (n+1) 0..1 arrays with no 2 X 2 subblock having x11-x00 less than x10-x01.at n=4A251270
- Number of different periodic multisets that fit within some normal multiset of weight n.at n=16A304648
- 'Geobonnaci' sequence: a(1)=a(2)=1, thereafter a(n) = round( 2 * sqrt(a(n-1) * a(n-2)) ).at n=21A322332
- Number of regions in a "cross" of width 3 and height n (see Comments for definition).at n=14A331455
- G.f. satisfies A(x) = ( 1 + x * (A(x)^(1/2) / (1-x))^(3/2) )^2.at n=8A370477
- G.f. A(x) satisfies A(x) = 1/((1 - x*A(x)^2) * (1 - x*A(x)^3)).at n=5A379285