12046
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
- 19080
- Proper Divisor Sum (Aliquot Sum)
- 7034
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5688
- Möbius Function
- -1
- Radical
- 12046
- 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
- 42
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = (d(n) - r(n))/5, where d = A026037 and r is the periodic sequence with fundamental period (1,2,0,2,0).at n=54A026039
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={2}.at n=11A079995
- Coefficient of x^n in the expansion of (1+x+x^3)^n.at n=11A116411
- 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, 0), (-1, 1, 0), (0, 0, -1), (0, 0, 1), (1, 0, 0)}.at n=8A150054
- Cyclops numbers whose squares are cyclops numbers.at n=10A239827
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 654", based on the 5-celled von Neumann neighborhood.at n=33A273332
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 237", based on the 5-celled von Neumann neighborhood.at n=30A280139
- Number of (not necessarily connected) graceful graphs on n vertices.at n=7A308548
- Sequence shifts left seven places under Weigh transform with a(n) = signum(n) for n<7.at n=39A316079
- Sequence shifts left ten places under Weigh transform with a(n) = signum(n) for n<10.at n=47A316082
- G.f.: Sum_{n>=0} (n+1) * x^n * (1 + x^n)^n.at n=66A326002
- Coefficients of polynomials related to ordered set partitions. Triangle read by rows, T_{m}(n, k) for m = 4 and 0 <= k <= n.at n=7A326585
- a(n) is the number of partitions of n with Durfee square of size <= 4.at n=34A330642
- Triangle T(n,k), n>=0, 0 <= k <= n, read by rows, where T(n,k) is the number of self-avoiding paths in (2*n+1) X (2*k+1) grid starting the upper left corner, passing through the center of grid and finishing the lower right corner.at n=11A333685
- Number of self-avoiding paths in (2*n+1) X 3 grid starting the upper left corner, passing through the center of grid and finishing the lower right corner.at n=4A333686
- Numbers k such that (A003961(k)-2*k) divides (A003961(k)-sigma(k)), where A003961 is fully multiplicative with a(prime(i)) = prime(i+1), and sigma is the sum of divisors function.at n=26A378980
- Array read by downward antidiagonals: A(n,k) = A(n-1,k+1) + Sum_{j=0..k} A(n-1,j)*A(k-j,0) with A(0,k) = 1.at n=31A392095