12047
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13776
- Proper Divisor Sum (Aliquot Sum)
- 1729
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10320
- Möbius Function
- 1
- Radical
- 12047
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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 k such that k divides the (left) concatenation of all numbers <= k written in base 6 (most significant digit on right and removing all least significant zeros before concatenation).at n=7A029523
- Numbers whose base-4 representation contains exactly two 0's and four 3's.at n=34A045075
- Number of factorizations with 3 levels of parentheses indexed by prime signatures. A050340(A025487).at n=25A050341
- Number of n X n binary arrays symmetric about the diagonal and under 90-degree rotation with all ones connected only in two by two blocks.at n=17A145862
- Let c(n) = x^(2^n-1)*(1-x^(2^n)), g(n) = 1 + x^(2^n-1) + x^(2^n), h(n) = Product_{i=1..n} g(i); then use g.f. (1+2*x) - Sum_{n>=1} c(n)/h(n).at n=67A151684
- a(n) = Sum of all numbers of divisors of all numbers < (n+1)^2.at n=38A168011
- Numbers whose Schwarzian arithmetic derivative is an integer.at n=24A209872
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2+x^2+y^2>2n.at n=23A211644
- Numerator of Sum_{k=1..n} 1/sigma(k).at n=14A212717
- Solutions of the equation k'' = tau(k) * k', where k' and k'' are the first and the second arithmetic derivative of k.at n=7A230544
- E.g.f.: Sum_{n>=0} Integral^n (exp(x) + 1)^n dx^n, where integral^n F(x) dx^n is the n-th integration of F(x) with no constant of integration.at n=9A234643
- Decimal representation of the n-th iteration of the "Rule 89" elementary cellular automaton starting with a single ON (black) cell.at n=7A267039
- a(n) = Sum_{i=1..n} phi(i)*phi(i+1), where phi(n) = A000010(n) is Euler's totient function.at n=46A330319
- Positive numbers k such that k and k + 1 are both positive negaFibonacci-Niven numbers (A331085) and -k and -(k + 1) are both negative negaFibonacci-Niven numbers (A331088).at n=26A331092
- a(n) is the number of overpartitions of n where overlined parts are not divisible by 3 and non-overlined parts are congruent to 1 modulo 3.at n=40A335754
- G.f. A(x) = Sum_{n>=1} a(n)*x^(3*n-2) satisfies: A(x*R(x)) = x^2 - x^5, where A(R(x)) = x.at n=6A350476