11319
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
- 16
- Divisor Sum
- 19200
- Proper Divisor Sum (Aliquot Sum)
- 7881
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5880
- Möbius Function
- 0
- Radical
- 231
- Omega Function (Ω)
- 5
- 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
- 68
- 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
- Numbers that are the sum of 8 positive 7th powers.at n=38A003375
- Number of steps to compute n-th prime in PRIMEGAME (fast version).at n=7A007546
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-7).at n=22A023437
- a(n) = T(2n,n+1), where T is the array defined in A025177.at n=5A025188
- a(n) = 49*(n-1)*(n-2)/2.at n=20A027469
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 35.at n=37A031533
- Odd numbers with exactly 5 palindromic prime factors (counted with multiplicity).at n=36A046375
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n.at n=41A057263
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=A001764(n), a(n,n)=A006013(n), a(n,n-1)=A006629(n-1).at n=32A073147
- Starting positions of strings of three 5's in the decimal expansion of Pi.at n=10A083620
- 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=30A110433
- 7 times pentagonal numbers: a(n) = 7*n*(3*n-1)/2.at n=33A152744
- a(n) = binomial(n+1,2)*7^2.at n=21A162942
- First of two consecutive numbers with at least one 3 in their prime signature.at n=56A176313
- Number of lower triangles of an n X n integer array with each element differing from all of its vertical and horizontal neighbors by 3 or less and triangles differing by a constant counted only once.at n=2A195273
- T(n,k) = Number of lower triangles of an n X n integer array with each element differing from all of its vertical and horizontal neighbors by k or less and triangles differing by a constant counted only once.at n=12A195278
- Number of lower triangles of a 3 X 3 integer array with each element differing from all of its vertical and horizontal neighbors by n or less and triangles differing by a constant counted only once.at n=2A195279
- For any number n take the polynomial formed by the product of the terms (x-pi), where pi's are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is equal to zero.at n=31A203614
- a(n) is the number of terms in the expansion of (x-y)(x^3-y^3)*(x^6-y^6)*(x^10-y^10)*...*(x^T_i-y^T_i), where T_i is the i-th triangular number.at n=39A222028
- a(n) = n^3*(2*n^2+1)/3.at n=7A272125