13780
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 31752
- Proper Divisor Sum (Aliquot Sum)
- 17972
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 0
- Radical
- 6890
- Omega Function (Ω)
- 5
- 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
- no
- 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
- Number of two-rowed partitions of length 3.at n=40A001993
- a(n) = Sum_{i=0..n-1} a(i)*a(n-i), with a(0) = 1 and a(1) = 4.at n=8A014433
- Numbers having four 4's in base 6.at n=32A043388
- Number of multigraphs with loops on 3 nodes with n edges.at n=22A050531
- Number of atoms in cluster of n layers around C_60.at n=15A063498
- Arithmetic derivative of (prime(n)+1)*(prime(n+1)+1)/4.at n=37A079094
- Fourth column of (1,5)-Pascal triangle A096940.at n=38A096941
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=31A097387
- a(n) = 8*n^2 + 8*n + 4.at n=41A108099
- Column 11 of table A105552.at n=13A110554
- Numbers k such that 1*k + 1, 3*k + 1, 9*k + 1, 27*k + 1 are all primes.at n=17A112041
- Numbers k such that k^2 divides 21^k-1.at n=32A128401
- Möbius transform of the Pell numbers (A000129).at n=11A133726
- Number of non-Fibonacci parts in all partitions of n.at n=30A144116
- Expansion of 1 / ((1+x)*(1-x-4*x^2)). (5,4)-Padovan sequence.at n=11A176738
- a(n) = sum(binomial(n,k)*floor(sqrt(Bell(k))),k=0..n).at n=10A192576
- Irregular triangle T(n,k) read by rows: T(n,k) is the number of compositions of n with k descents, n>=0, 0<=k<=floor(n/3).at n=53A238344
- Number of compositions of n with exactly two descents.at n=10A241627
- Sum of primes between 100*n and 100*n + 99.at n=11A276355
- 1^2 + 3^2, 2^2 + 4^2, 5^2 + 7^2, 6^2 + 8^2, ...at n=41A276764