12061
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13792
- Proper Divisor Sum (Aliquot Sum)
- 1731
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10332
- Möbius Function
- 1
- Radical
- 12061
- 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
- 94
- 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
- a(n) = floor(2nd elementary symmetric function of Sum_{j=1..k} 1/j, k = 1,2,...,n).at n=43A025212
- Triangle read by rows where T(n,k) is the number of factorizations of (n+1)! into k distinct factors.at n=57A157836
- Number of strings of numbers x(i=1..7) in 0..n with sum i^3*x(i)^2 equal to 343*n^2.at n=20A184308
- a(n) = 6*n^2 + 10*n + 5.at n=44A201279
- Number of zero-sum -n..n arrays of 4 elements with first through third differences also in -n..n.at n=24A202512
- Number of distinct values of Sum_{i=0..n} x(i)*binomial(n,i), where the x(i) have values in 0..3.at n=12A205538
- Smallest number k such that sopf(k)/digsum(k) = prime(n) where sopf(k) is the sum of the distinct primes dividing k and digsum(k) the sum of digits of k.at n=39A241049
- Numbers that have all their divisors in A002191 (possible values for sigma(n), A000203).at n=38A243765
- The broken eggs problem.at n=28A256101
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 505", based on the 5-celled von Neumann neighborhood.at n=24A272583
- p-INVERT of (1,0,0,1,0,0,1,0,0,...), where p(S) = 1 - S - S^2 - S^3.at n=13A292322
- Numbers k such that (22*10^k + 257)/9 is prime.at n=17A294990
- Consecutive terms that appear more than once in A014237.at n=46A322155
- Number of ways to write n as an ordered sum of 7 primes (counting 1 as a prime).at n=19A341986
- Triangle read by rows: T(n,k) is the number of (unlabeled) connected graphs with n nodes and metric dimension k, 0 <= k < n.at n=38A348600
- Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1).at n=27A357694
- G.f.: 1/Product_{k>=1} (1 - x^(2*k^2)) * (1 - x^k).at n=28A385011