11913
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18288
- Proper Divisor Sum (Aliquot Sum)
- 6375
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6840
- Möbius Function
- 0
- Radical
- 627
- 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
- 112
- 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
- no
- Odd
- yes
Appears in sequences
- Powers of rooted tree enumerator.at n=18A000439
- a(n) = floor( n*(n-1)*(n-2)/20 ).at n=63A011902
- a(n) = (2*n - 5)n^2.at n=19A015240
- a(n) = a(n-1) + a(n-2) + n, a(0) = a(1) = 1.at n=17A030119
- Composite numbers k such that digits in k and in juxtaposition of prime factors of k are the same (apart from multiplicity).at n=24A035141
- Numerators of continued fraction convergents to sqrt(319).at n=6A041602
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n.at n=31A057257
- Composite numbers k+1 such that k*phi(k+1) is a perfect square.at n=19A069068
- Number of partitions of n into >= 2 parts and with minimum part >= 2.at n=43A083751
- Table T(n,k) read by rows which contains in row n and column k the sum of A001055(A036035(n,j)) over all column indices j where A036035(n,j) has k distinct prime factors.at n=41A093936
- Structured disdyakis triacontahedral numbers (vertex structure 5).at n=8A100160
- Number of partitions of n in which both smallest and largest part occur only once.at n=43A117995
- Multiples of 19 containing a 19 in their decimal representation.at n=19A121039
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k returns to the x-axis (1 <= k <= n).at n=37A128741
- a(n) = (2*n^3 + 5*n^2 + 5*n)/2.at n=21A162267
- Totally multiplicative sequence with a(p) = 7p-2 for prime p.at n=44A166671
- Sum of all parts of all partitions of n minus the number of partitions of n.at n=19A182724
- Number of arrays of -6..6 integers x(1..n) with every x(i) in a subsequence of length 1, 2, 3 or 4 with sum zero.at n=4A193708
- T(n,k)=Number of arrays of -k..k integers x(1..n) with every x(i) being in a subsequence of length 1, 2, 3 or 4 with sum zero.at n=49A193710
- Number of 0..n arrays x(0..7) of 8 elements with zero 4th differences.at n=37A200331