11848
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22230
- Proper Divisor Sum (Aliquot Sum)
- 10382
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5920
- Möbius Function
- 0
- Radical
- 2962
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 37
- 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
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=24A020342
- Number of partitions of n into parts not of the form 17k, 17k+4 or 17k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=37A035965
- Expansion of (3+2*x^2)/(1-x)^4.at n=23A037236
- Number of trees with n nodes and 8 leaves.at n=8A055295
- Number of planar partitions of n where parts strictly decrease along each row and column.at n=27A114736
- Number of ways to write n as an ordered sum of 1's, 2's and 3's such that no 2 precedes any 1.at n=23A124062
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0110-1111-0110 pattern in any orientation.at n=16A146923
- For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=27A185718
- Number of 3-step one or two space at a time rook's tours on an n X n board summed over all starting positions.at n=15A187288
- a(n) = floor(volume of 4-sphere of radius n).at n=7A210519
- Number of partitions of n containing at least one prime.at n=34A235945
- Indices of records in A245203 (= least k>=0 such that 4n+3 is the mean of primes 4(n-k)+3 and 4(n+k)+3).at n=23A245205
- Number of 3Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors equal to itself.at n=18A266013
- a(n) = (conjectured) smallest positive integer k which is neither of the form p + n^x nor of the form p - n^x with x >= 0 and p prime, where gcd(k, n) = 1 and gcd(k^2-1, n-1) = 1.at n=31A283619
- Number of minimal dominating sets in the n-antiprism graph.at n=12A290377
- Expansion of g.f. exp( Sum_{n>=1} ( Sum_{k>=1} k^n*x^k )^n * (1-x)^n / n ).at n=7A370017