13262
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21000
- Proper Divisor Sum (Aliquot Sum)
- 7738
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6264
- Möbius Function
- -1
- Radical
- 13262
- Omega Function (Ω)
- 3
- 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
- 138
- 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
- Coordination sequence for MgZn2, Position Zn1.at n=29A009937
- Triangle T(n,k) defined by: T(0,0)=1, T(n,k)=0 if k < 0 or k > n, T(n,k) = T(n-1,k-1) + k*T(n-1,k) + Sum_{j>=1} T(n-1,k+j).at n=45A116155
- a(1) = 1, a(2) = 2; for n>2, a(n+1) = a(n)*(n-1) + a(n-1)*n.at n=7A122972
- Number of black/white colorings of a 3 X n rectangle which have no monochromatic 2 by 2 subsquares.at n=5A133129
- 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, 0, 0), (0, -1, 0), (0, 0, 1), (1, 1, -1)}.at n=10A148320
- Triangle read by rows, inverse binomial transform of A152431.at n=45A152432
- Numbers n such that sqrt(36*n+49) is prime.at n=42A168669
- Number of nX5 binary matrices with no 2X2 circuit having pattern 0101 in any orientation.at n=2A181240
- T(n,k) = Number of n X k binary matrices with no 2 X 2 circuit having pattern 0101 in any orientation.at n=23A181245
- T(n,k) = Number of n X k binary matrices with no 2 X 2 circuit having pattern 0101 in any orientation.at n=25A181245
- G.f.: 1/(1 - x*(1-x^3)/(1 - x^2*(1-x^4)/(1 - x^3*(1-x^5)/(1 - x^4*(1-x^6)/(1 - ...))))), a continued fraction.at n=26A227360
- Numbers k such that A084937(3k) > A084937(3k+1).at n=34A249689
- Triangle read by rows: T(n,k) is the number of simple graphs on n labeled nodes with k articulation vertices, (0 <= k <= n).at n=21A370065
- Number of simple graphs on n labeled nodes with 0 cutpoints (articulation vertices).at n=6A370066
- Number of polyforms with n cells on the faces of a deltoidal icositetrahedron up to rotation.at n=17A383805
- a(0) = 1; thereafter a(n) = 5*n^2 - 5*n + 2.at n=52A386485