13296
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 34472
- Proper Divisor Sum (Aliquot Sum)
- 21176
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4416
- Möbius Function
- 0
- Radical
- 1662
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 138
- 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
- Number of points on surface of truncated cube: a(n) = 46*n^2 + 2 for n > 0.at n=17A005911
- a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=10.at n=16A022409
- "DHK" (bracelet, identity, unlabeled) transform of 1,1,1,1,...at n=19A032245
- Numbers whose base-4 representation contains exactly three 0's and four 3's.at n=9A045080
- Numbers k such that k^2 + k + 1, k^3 + k + 1 and k^4 + k + 1 are all prime.at n=36A057683
- 2*3*5*6*...*a(n) -+ 1 are primes, with a(n+1) > a(n).at n=38A087900
- a(n) = 16*(8*prime(n) + 7).at n=26A098823
- a(n) = 512*n - 16.at n=25A157447
- Number of partitions of n such that m(2) < m(3), where m = multiplicity.at n=41A240063
- Numbers n with the property that it is possible to write the base 2 expansion of n as concat(a_2,b_2), with a_2>0 and b_2>0 such that, converting a_2 and b_2 to base 10 as a and b, we have (sigma(a)-a)*(sigma(b)-b) = n.at n=1A259831
- Numbers k such that 6*10^k + 17 is prime.at n=19A285632
- a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 170).at n=13A289452
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1)^2, where a(0) = 1, a(1) = 4, b(0) = 2, b(1) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=13A296253
- Apply Lenormand's transformation k -> A318921(k) to the Fibonacci numbers.at n=45A318922
- Number of compositions of n whose differences of all degrees > 1 are nonzero.at n=17A325875
- Triangle read by rows: T(n,k) = number of permutations p of [n] such that max(|p(p(i)) - i|)=k (n>=1, 0<=k<=n-1).at n=39A364817
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A384982.at n=59A384985