12146
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18222
- Proper Divisor Sum (Aliquot Sum)
- 6076
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6072
- Möbius Function
- 1
- Radical
- 12146
- 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
- 63
- 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
- yes
- Odd
- no
Appears in sequences
- A generalized partition function.at n=18A002599
- Number of integer points (x,y,z) at distance <= 0.5 from sphere of radius n.at n=31A016728
- Powers of cube root of 13 rounded down.at n=11A018012
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 3 (mod 4).at n=56A046779
- G.f.: 1/(1 - x/(1 - x^3/(1 - x^6/(1 - x^10/(1 - x^15/(1 - x^21/(1 -...- x^(n*(n+1)/2)/(1 -...))))))), a continued fraction.at n=26A206740
- Numbers k such that 4^k - 5 is prime.at n=35A217348
- Number of length 3 arrays x(i), i=1..3 with x(i) in i..i+n and no value appearing more than 2 times.at n=21A250352
- Number of (n+2) X (6+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 1 and no column sum 1.at n=18A257445
- Number of partitions of subsets of {1,...,n}, where consecutive integers are required to be in the same part and the elements of {1, n} are required to be in the same part if they are both members of a subset.at n=11A261492
- Expansion of (1-q)^k/Product_{j=1..k} (1-q^j) for k=12.at n=34A275643
- Number of permutations p of [n] such that 0p has a nonincreasing jump sequence beginning with seven.at n=4A292173
- Numbers k such that tau(k) + tau(k+1) + tau(k+2) + tau(k+3) = 16, where tau is the number of divisors function A000005.at n=15A350686
- Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 9, up to isomorphism.at n=36A358249
- Number of odd semiprimes less than 2^n.at n=16A362042
- Main diagonal of A368179: the n-th term in the trajectory of n under the A006368 map.at n=56A368180
- Expansion of 1/(1 - x/(1 - 25*x^5)^(1/5)).at n=19A373510
- Numbers k such that A380459(k) has no divisors of the form p^p, while A003415(k) has such a divisor or is 0.at n=44A380474
- Consecutive states of the linear congruential pseudo-random number generator (1255*s + 6173) mod 29282 when started at s=1.at n=17A385339
- a(n) is the number of ways n^n can be written as s^t*u^v, where s, t, u, v are integers > 1 and s^t <= u^v.at n=41A390604