12361
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12672
- Proper Divisor Sum (Aliquot Sum)
- 311
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12052
- Möbius Function
- 1
- Radical
- 12361
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 58 ones.at n=21A031826
- Denominators of continued fraction convergents to sqrt(746).at n=10A042437
- Number of colors that can be mixed with up to n units of yellow, blue, red.at n=43A048134
- Numbers n such that sigma_3(n) is divisible by square of cototient of n, while n is not a prime number.at n=12A091286
- Minimal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=40A110611
- Number of ways, counted up to symmetry, to build a contiguous building with n LEGO blocks of size 1 X 5 which is flat, i.e., with all blocks in parallel position and symmetric after a rotation by 180 degrees.at n=9A123789
- Number of base 23 n-digit numbers with adjacent digits differing by two or less.at n=5A126410
- a(1)=1, a(n)=a(n-1)+n^2 if n odd, a(n)=a(n-1)+ n^0 if n is even.at n=40A140148
- Partial sums of A151782.at n=27A151793
- Composite numbers k for which k - phi(k) divides k-1.at n=10A160599
- Triangle, read by rows, T(n,k) = Sum_{j=1..k} binomial(n-1, j-1)*binomial(k, j - 1)*(j-1)!.at n=40A176122
- Mountain nonprimes.at n=46A182776
- Number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock singular.at n=2A185514
- Number of (n+1) X 4 0..2 arrays with every 2 X 2 subblock singular.at n=1A185515
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock singular.at n=7A185521
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock singular.at n=8A185521
- a(n) = 25*n^2 + 15*n + 1021.at n=21A214732
- a(n) = (6*n^2 + 7*n - 9 + 2*n^3)/12 - (-1)^n*(n+1)/4.at n=40A219527
- Square array read by ascending antidiagonals, T(n, k) = k!*[x^k](exp(x)*sum(j=0..n, C(2*n,j)*x^j)), n>=0, k>=0.at n=50A253670
- Pseudoprimes to base 7, written in base 7.at n=11A262104