12019
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14688
- Proper Divisor Sum (Aliquot Sum)
- 2669
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9600
- Möbius Function
- -1
- Radical
- 12019
- Omega Function (Ω)
- 3
- 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
- 94
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Triangle read by rows: cube of the lower triangular mean matrix.at n=10A027447
- Numerator of Sum_{k=1..n} H(k)/k, where H(k) is k-th harmonic number.at n=4A027459
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 15 ones.at n=12A031783
- Expansion of x / ((1-12x)(1-15x)(1-20x)(1-30x)(1-60x)).at n=3A103878
- Square array T(n,k) read by antidiagonals: numerators of Stirling numbers of first kind with negative argument S1(-n,k), n,k>=0.at n=30A103879
- Triangle of numerators of the cube of a certain lower triangular matrix.at n=10A119935
- Sums of three consecutive hexagonal numbers.at n=44A129109
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150813
- 7 times pentagonal numbers: a(n) = 7*n*(3*n-1)/2.at n=34A152744
- Triangle read by rows: T(n, k) = binomial(n, k)/Beta(n+1, n-k+1) + binomial(n, n-k)/Beta(n+1, k+1).at n=21A156052
- Triangle read by rows: T(n, k) = binomial(n, k)/Beta(n+1, n-k+1) + binomial(n, n-k)/Beta(n+1, k+1).at n=27A156052
- S(n) - the sum of the areas of the polygons constructed from connecting with a straight line all identical members in the multiplicative table modulo n (finite field).at n=25A157023
- Sums of prime points found in four grids in each corner of a square.at n=37A161190
- G.f. satisfies A(x) = 1/Product_{n>=1} (1 - x^n*A(x^n)^2).at n=7A196192
- Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,2,1,1,1 for x=0,1,2,3,4.at n=5A197538
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,2,1,1,1 for x=0,1,2,3,4.at n=5A197543
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,2,1,1,1 for x=0,1,2,3,4.at n=60A197545
- Square array read by ascending antidiagonals where T(n,k) is the mean number of maxima in a set of n random k-dimensional real vectors (numerators).at n=23A257894
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 331", based on the 5-celled von Neumann neighborhood.at n=25A271279
- Partial sums of A304050.at n=45A304075