13116
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 30632
- Proper Divisor Sum (Aliquot Sum)
- 17516
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4368
- Möbius Function
- 0
- Radical
- 6558
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 107
- 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
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=43A005892
- Expansion of Product_{m>=1} (1 + m*q^m)^12.at n=5A022640
- a(n) = C(n+2,3) + 2*C(n,2) + 2*(n-2).at n=39A034857
- Numbers whose base-4 representation contains exactly three 0's and four 3's.at n=6A045080
- Lengths of successive generations of the Kolakoski sequence A000002.at n=21A054352
- Number of ways writing 2^n as a sum of two nonprime numbers.at n=14A062306
- Numbers k such that 2^k mod k = 2^k mod k^2.at n=30A068535
- Numbers k such that (k / sum of digits of k) and (k+1 / sum of digits of k+1) are both prime.at n=17A085775
- Number of squares on infinite chessboard that a knight can reach in n moves from a fixed square.at n=43A118312
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0110 (n,k >= 0).at n=42A118890
- Number of binary sequences of length n containing exactly one subsequence 0110.at n=15A118892
- Numbers k that are not powers of 2 such that 2^k mod k = 2^k mod k^2; or A068535 with powers of 2 excluded.at n=16A125773
- Numbers k such that k, k + 1 and k + 2 are 3 consecutive Harshad numbers.at n=36A154701
- Number of collinear point 5-tuples in an n X n cubical grid.at n=10A178257
- Index of first occurrence of 2n in A031883, or 0 if 2n never occurs in A031883 = first differences of lucky numbers A000959.at n=35A181558
- Number of (n+1)X(n+1) 0..3 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal and vertical neighbors.at n=1A205089
- Number of (n+1)X3 0..3 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal and vertical neighbors.at n=1A205091
- T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=4A205097
- a(n) is a refactorable number and the sum of all refactorable numbers <= a(n) is also a refactorable number.at n=31A235177
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 534", based on the 5-celled von Neumann neighborhood.at n=35A272788