11439
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17472
- Proper Divisor Sum (Aliquot Sum)
- 6033
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7200
- Möbius Function
- 0
- Radical
- 3813
- 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
- 55
- 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
- a(n) = (n + 3)*(n^2 + 6*n + 2)/6.at n=38A005286
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=22A020342
- a(n) = Sum{T(i,j)}, 0<=j<=i, 0<=i<=n, T given by A026907.at n=7A026917
- a(n) = floor(n^3 / Pi).at n=33A032633
- Number of partitions of n into parts 3k+1 and 3k+2 with at least one part of each type.at n=44A035620
- One less than number of n-multisets chosen from a 10-set.at n=7A035927
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n-1)/2.at n=16A047171
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n-2)/2.at n=15A047182
- T(n,k) = S(2n,n-1,k-1), 0 <= k <= n, n >= 0, array S as in A050157.at n=43A050160
- T(n, k) = S(2n+2, n+2, k+2) for 0<=k<=n and n >= 0, array S as in A050157.at n=34A050163
- Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 3 for n > 0. Numbers n such that (690*10^n + 3)/9 is prime.at n=7A056260
- a(n) = 3*n*(4*n-1).at n=31A062783
- Records in A065925.at n=18A065927
- z-value of the solution (x,y,z) to 5/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z and having the largest z-value. The x and y components are in A075249 and A075250.at n=38A075251
- a(n) = a(n-1) + a(n-2) + n (mod 3), with a(1)=a(2)=1.at n=19A081410
- a(1) = 1 then the least multiple of odd numbers not odd multiples of 5, (3,7,9,11,13,17,19,21,23,27,29,...) such that every partial concatenation is noncomposite.at n=37A110433
- Divisors of 10^15 - 1.at n=30A111117
- a(1) = 3, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime.at n=41A111473
- a(n) = C(n,7)-1.at n=9A124090
- Triangle, read by rows, equal to R^3, the matrix cube of R = A135894.at n=32A135896