13756
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25480
- Proper Divisor Sum (Aliquot Sum)
- 11724
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6480
- Möbius Function
- 0
- Radical
- 6878
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 151
- 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
- Number of multiset permutations of {1, 1, 2, 2, ..., n, n} with no fixed points.at n=5A000459
- a(0) = 1, a(n) = 26*n^2 + 2 for n>0.at n=23A010016
- Denominators of continued fraction convergents to sqrt(363).at n=3A041687
- Numbers k such that k | sigma_6(k).at n=41A055710
- Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers): Triangle T(n,k) = number of ways to get k matches for a deck with n cards, 2 of each kind.at n=25A059056
- Card-matching numbers (Dinner-Diner matching numbers).at n=7A059070
- Duplicate of A000459.at n=5A059072
- a(n) = 4*n*(floor(n^2/2)+1). For n >= 3, this is the number of directed Hamiltonian paths on the n-prism graph.at n=19A124350
- a(0) = 0, a(1) = 1, a(n+1) = (2*n^2+2*n+13)*a(n) - n^4*a(n-1).at n=4A142997
- Number of ways to place 2 nonattacking zebras on an n X n board.at n=12A172137
- Nonnegative integers m such that m^2 = (a^2-1)*(b^2+1) for some integers a,b.at n=40A174134
- A recursive sequence: a(n) = Fibonacci(n)*a(n-1) + 2.at n=6A238243
- Numbers n such that 4n + 1, 4n + 2 and 4n + 3 are not squarefree.at n=30A258332
- Number of ways to trisect a triangle with side length n exactly into three identical parts in a triangular lattice.at n=9A271858
- Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]).at n=42A274105
- Self-convolution of a(n)/4^n gives fibonorials (A003266).at n=5A277363
- a(n) = A293518(n) - A293519(n); how many more surviving even nodes than surviving (but not bifurcating) odd nodes there are at generation n in the binary tree of persistently squarefree numbers.at n=36A293517
- Number of integer partitions of n into relatively prime parts that are all greater than 1.at n=44A302698
- Number of n X 3 0..1 arrays with every element unequal to 0, 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=9A317038
- Starts of runs of 5 consecutive even numbers that are all totient numbers (A002202).at n=42A333022