13986
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 36480
- Proper Divisor Sum (Aliquot Sum)
- 22494
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3888
- Möbius Function
- 0
- Radical
- 1554
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 107
- 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
- Numbers k such that k and 6*k are anagrams.at n=3A023090
- Let p1, p2 be first pair of consecutive primes with difference 2n; let p3, p4 be 2nd such pair; sequence gives "wadi" value p3-p1.at n=24A046728
- Truncated triangular pyramid numbers: a(n) = (n-7)*(n^2 + 10*n - 108)/6, n >= 8.at n=36A051941
- When expressed in base 3 and then interpreted in base 7, is a multiple of the original number.at n=31A062884
- a(n) = Catalan(n)*(3^(n+1) - 2^(n+1) + 1)/2.at n=5A063017
- Numbers k such that k^6 + 1091 is prime.at n=8A066386
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives x's for indecomposable Wallis pairs with x < y (ordered by values of x).at n=30A075768
- Molien series for complete weight enumerators of trace-additive Hermitian self-dual codes over the Galois ring GR(4,2).at n=6A100024
- Numbers that have exactly six prime factors counted with multiplicity (A046306) whose digit reversal is different and also has 6 prime factors (with multiplicity).at n=18A109026
- Rectangular table, read by antidiagonals, where row n is equal to column 0 of matrix power A121412^(n+1) for n>=0.at n=41A121424
- Number of subpartitions of partition P=[0,1,1,2,2,2,3,3,3,3,4,...] (A003056).at n=18A121430
- Square array, read by antidiagonals, where T(n,k) = T(n,k-1) + T(n-1,k+n) for n>0, k>0, such that T(n,0) = T(n-1,n) for n>0 with T(0,k)=1 for k>=0.at n=39A136733
- Row sums of triangle A138015.at n=15A138016
- a(1) = 3, a(n) = round(a(n-1)*3/2) for n > 1, using round-to-even method.at n=21A147790
- a(n) = sum of the squares of the coefficients of x^(2k) in A(x^2)^{2*(n-2k)+1}, as k varies from 0 to floor(n/2), with a(0)=1.at n=8A162249
- a(n) is the smallest positive number such that a(n)*n is an anagram of a(n)*9.at n=17A175698
- Triangle T(n, k) = coefficients of (n+1)!*(binomial(x+n+1, n+1) - binomial(x, n+1)), read by rows.at n=42A178126
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of semilength n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k UUU's (U=(1,1)).at n=53A191518
- Number of dispersed Dyck paths of semilength n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having no UUU's (U=(1,1)).at n=17A191519
- Array t(n,k) = k^(2n)*(k^(2n)-1)*BernoulliB(2n)/(2n), n>=1, k>=2, absolute values read by ascending antidiagonals.at n=19A241066