11819
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 277
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11544
- Möbius Function
- 1
- Radical
- 11819
- Omega Function (Ω)
- 2
- 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
- 143
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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 whose set of base-14 digits is {3,4}.at n=28A032838
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=41A064909
- a(n) = a(n-1) XOR Sum_{k=1..n-1} a(k), with a(1)=1, a(2)=3, where XOR is the binary exclusive OR operation.at n=13A099811
- Numbers k for which (9 + k!)/9 is prime.at n=11A137390
- Square array of number of distinct m X n (0,1) matrices after iterated double sorting, read by antidiagonals.at n=59A171699
- Square array of number of distinct m X n (0,1) matrices after iterated double sorting, read by antidiagonals.at n=61A171699
- Array T(n,k) = number of n X k binary matrices with rows and columns in lexicographically nondecreasing order.at n=39A180985
- Array T(n,k) = number of n X k binary matrices with rows and columns in lexicographically nondecreasing order.at n=41A180985
- Number of nX4 binary arrays with rows and columns in nondecreasing order.at n=5A184139
- Number of nX6 binary arrays with rows and columns in nondecreasing order.at n=3A184141
- a(n) = 8*n^2 + 7*n + 1.at n=38A194268
- The nearest integer of perimeter of T-square (fractal) after n-iterations, starting with a unit square.at n=18A227621
- Number of (n+1)X(3+1) 0..1 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..3+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=4A232792
- Number of (n+1)X(5+1) 0..1 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..5+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=2A232794
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=23A232797
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=25A232797
- Number of partitions of n with difference 2 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=40A242693
- a(n) = prime(n)^3 mod (n^2 + prime(n)^2).at n=51A243769
- Numbers k such that (41*10^k + 373)/9 is prime.at n=18A285377
- Number of subsets of {2..n} such that the product of the elements is a decimal palindrome.at n=43A339508