12620
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26544
- Proper Divisor Sum (Aliquot Sum)
- 13924
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 0
- Radical
- 6310
- Omega Function (Ω)
- 4
- 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
- 94
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of 1's in n-th term of A006711.at n=35A022477
- Numbers whose base-5 representation contains exactly three 0's and three 4's.at n=2A045217
- Number of fibeven primes (A095080) in range ]2^n,2^(n+1)].at n=17A095060
- Numbers whose set of base 5 digits is {0,4}.at n=38A097251
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having k u=(2,1) steps among the steps leading to the first d step.at n=22A108440
- Shadow of Euler's constant exp(1).at n=29A108912
- Determinants of 3 X 3 matrices of discrete blocks of 9 consecutive primes.at n=41A117329
- 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, 0, -1), (0, -1, 1), (1, 1, 0), (1, 1, 1)}.at n=7A150913
- Potential magic constants of 8 X 8 magic squares composed of consecutive primes.at n=30A189188
- Triangle T(n, k) of the number of n X n binary matrices with k = 0..n^2 1's and no more than three 1's in the corners of any square sub-block.at n=38A227436
- Number of length n arrays x(i), i=1..n with x(i) in i..i+3 and no value appearing more than 2 times.at n=6A250346
- T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in i..i+k and no value appearing more than 2 times.at n=42A250351
- Number of length 7 arrays x(i), i=1..7 with x(i) in i..i+n and no value appearing more than 2 times.at n=2A250356
- Number of (7+1)X(n+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=8A253704
- Number of (n+2)X(n+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000101.at n=3A259993
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000101.at n=3A259997
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000101.at n=24A260001
- Number of 2 X 2 matrices with all terms in {-n,...,0,...,n} and (sum of terms) = permanent.at n=29A280914
- Number of totally transitive rooted trees with n nodes.at n=24A318185
- Coefficients in the power series A(x) such that: x*A(x)^2 = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)) * A(x)^n.at n=7A357222