13948
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
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26712
- Proper Divisor Sum (Aliquot Sum)
- 12764
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6320
- Möbius Function
- 0
- Radical
- 6974
- 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
- 133
- 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
- Maxima of the rows of the triangle A259095.at n=43A005577
- a(n) = floor(n*(n^3-n-3)/(2*(n-1))).at n=28A117561
- 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, -1, 1), (-1, 1, -1), (0, 1, 1), (1, 0, 0)}.at n=9A149843
- Number of nX3 arrays of occupancy after each element stays put or moves to some horizontal, diagonal or antidiagonal neighbor, with every occupancy equal to zero or two.at n=5A221726
- T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, diagonal or antidiagonal neighbor, with every occupancy equal to zero or two.at n=33A221728
- Number of (n+1)X(2+1) 0..3 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=3A238282
- Number of (n+1)X(4+1) 0..3 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=1A238284
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=11A238287
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=13A238287
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 270", based on the 5-celled von Neumann neighborhood.at n=38A271089
- Numbers n such that Bernoulli number B_{n} has denominator 690.at n=21A272186
- Triangle read by rows: T(n,k) is the number of permutations of length n such that the minimum over maximum difference of elements in cycles is exactly k; 0 <= k < n.at n=37A346492