12895
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
- 4
- Divisor Sum
- 15480
- Proper Divisor Sum (Aliquot Sum)
- 2585
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10312
- Möbius Function
- 1
- Radical
- 12895
- 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
- 76
- 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 continued fraction for sqrt(k) has period 100.at n=35A020439
- Number of n X n symmetric binary arrays with rows, considered as binary numbers, in nondecreasing order, and no more than 2 1's in any row.at n=9A162036
- Triangle of coefficients of g.f. a*(1+x)^n + b*(1-x)^(n+2)*polylog(-n-1, x)/x + 2^n*c*(1-x)^(n+1)*LerchPhi(x, -n, 1/2), with a = -2, b = 2, c = 1.at n=23A168524
- Triangle of coefficients of g.f. a*(1+x)^n + b*(1-x)^(n+2)*polylog(-n-1, x)/x + 2^n*c*(1-x)^(n+1)*LerchPhi(x, -n, 1/2), with a = -2, b = 2, c = 1.at n=25A168524
- Number of (n+2) X 6 0..2 arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=5A186563
- Number of (n+2) X 8 0..2 arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=3A186565
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock commuting with each horizontal and vertical neighbor 3X3 subblock.at n=39A186568
- Number of (w,x,y,z) with all terms in {1,...,n} and 2w*x<=3*y*z.at n=12A211921
- Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 7).at n=16A212387
- Number of partitions of n into 8 parts such that every i-th smallest part (counted with multiplicity) is different from i.at n=22A244244
- a(1)=2, a(2)=3; then a(n+1) = smallest k such that S(k) = S(a(n)) + S(a(n-1)), (n>=2), where S is sopfr (A001414).at n=15A330988
- Nonprime numbers k whose arithmetic derivative k' (A003415) is a Fibonacci number (A000045).at n=32A362141
- Triangle read by rows: T(n,k) = number of free hexagonal polyominoes with n cells, where the maximum number of collinear cell centers on any line in the plane is k.at n=60A378015