12958
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 10082
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5400
- Möbius Function
- 1
- Radical
- 12958
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 125
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Convolution of Catalan numbers and powers of 2.at n=9A014318
- a(n) = n*(27*n - 1)/2.at n=31A022284
- Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=6A049062
- a(n) = a(n-1) + a(n-2) + (n+2)*binomial(n+3, 3)/2, with a(0) = 1, a(1) = 7.at n=10A054469
- McKay-Thompson series of class 22a for Monster.at n=24A058569
- Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).at n=2A094063
- 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, 1, -1), (-1, 1, 1), (0, 0, -1), (1, 0, 0)}.at n=10A148242
- a(n) = 9n^2 - n.at n=37A154516
- Number of ways to place zero or more nonadjacent 1,0 1,1 2,0 3,0 4,0 5,0 6,0 7,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155387
- a(n) = 36*n^2 - 2*n.at n=18A158062
- a(n) = 38*(38*n^2 - 1).at n=2A158764
- Number of 4-element nondividing subsets of {1, 2, ..., n}.at n=30A187491
- Multiples of 682.at n=19A200860
- For a polynomial P(m) with rational coefficients, denote by lcmd(P) the LCM of the denominators of all its coefficients. Then a(n) = lcmd(Sum_{i=1..m} (i^n*Sum_{j=1..i} j^n))/ lcmd((Sum_{i=1..m} i^n)^2).at n=46A202533
- Phi(n) values in A115921.at n=31A216381
- -2-Knödel numbers.at n=26A225506
- Number of n X n 0..2 arrays with rows in lexicographically nondecreasing order and columns in nonincreasing order.at n=3A229770
- T(n,k)=Number of n X n 0..k arrays with rows in lexicographically nondecreasing order and columns in nonincreasing order.at n=13A229774
- Number of 4X4 0..n arrays with rows in lexicographically nondecreasing order and columns in nonincreasing order.at n=1A229776
- Riordan array (1/(1-2*x), x*C(x)) where C(x) is the o.g.f. of Catalan numbers A000108.at n=56A247023