12695
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15240
- Proper Divisor Sum (Aliquot Sum)
- 2545
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10152
- Möbius Function
- 1
- Radical
- 12695
- 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
- 37
- 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) = n^3 + n^2 - 1.at n=22A003777
- Least j > 1 for n > 0 such that j^2 = (n^2 + 1)*(k^2) + (n^2 + 1)*k + 1 where k sequence = A106230.at n=23A106229
- A109507(10^n).at n=3A109508
- Number of ways to build a contiguous building with n LEGO blocks of size 1 X 6 on top of a fixed block of the same size so that the building is flat, i.e., with all blocks in parallel position and symmetric after a rotation by 180 degrees.at n=8A123801
- Numbers n such that the sum of the sum-of-divisors function of all integers up to n is a square.at n=6A130698
- a(n) = 529*n - 1.at n=23A158365
- a(n) = 24*n^2 - 1.at n=22A158544
- Constant term in the reduction of the polynomial (x+3)^n by x^2 -> x+1.at n=7A192240
- The number of subsets of the numbers {1,2,3...,n} consisting of at most 3 elements and at most two of those are even.at n=44A204555
- G.f.: A(x,y) = exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^6 * y^k] * x^n/n ) = Sum_{n>=0,k=0..n} T(n,k)*x^n*y^k, as a triangle of coefficients T(n,k) read by rows.at n=12A218116
- Number of binary words of length n with exactly 8 (possibly overlapping) occurrences of the subword given by the binary expansion of n.at n=21A236237
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 817", based on the 5-celled von Neumann neighborhood.at n=22A273648
- a(n) = Sum_{1 <= i, j <= n} gcd(i, j, n)^3.at n=22A368743
- Integers k such that 2^k contains all powers of 2 not exceeding k as substrings.at n=42A372680
- a(n) is the minimum number of squares from which an n-fold totally concave polyomino (n-TCP) can be made.at n=44A385602