13816
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28440
- Proper Divisor Sum (Aliquot Sum)
- 14624
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- 0
- Radical
- 3454
- Omega Function (Ω)
- 5
- 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
- 58
- 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
- a(n) = n^3 - floor( n/3 ).at n=24A002901
- Gaps of 7 in sequence A038593 (lower terms).at n=34A038653
- Numbers which retain their position in A073666 (position not disturbed by the rearrangement).at n=46A073667
- Self-convolution equals the binomial transform of A090358: A^2 = BINOMIAL(A090358), where A090358^6 = BINOMIAL(A090358^5).at n=5A090359
- Number of convex polyominoes with a 3 X n+1 minimal bounding rectangle.at n=9A093119
- 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), (0, 0, -1), (0, 1, 0), (0, 1, 1), (1, 0, 0)}.at n=7A151072
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) with k HUs, where U=(1,1) and H=(1,0).at n=64A191320
- a(n) = floor(sqrt(Bell(n))).at n=14A192570
- Number of (n+1)X(n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=7A250652
- Number of length n 1..(1+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=24A254940
- Number of factorizations of m^n into 3 factors, where m is a product of exactly 3 distinct primes and each factor is a product of n primes (counted with multiplicity).at n=27A257464
- a(n) is the smallest number of grains of sand placed at the center square of a (2n-1) X (2n-1) table so that some grains drop off the table by the end of the diffusion process.at n=43A259013
- a(n) = n^3 - 8.at n=24A259348
- Numbers k such that Bernoulli number B_{k} has denominator 61410.at n=4A295591
- Number of (undirected) paths in the n-book graph.at n=14A307921
- Sum of the even parts in the partitions of n into 4 parts.at n=44A309519
- Number of rooted identity trees with n vertices whose non-leaf terminal subtrees are not all different.at n=15A324971
- Numbers k such that there are exactly four biquadratefree powerful numbers (A338325) between k^2 and (k+1)^2.at n=10A338391
- Number of connected minimal dominating sets in the n-trapezohedral graph.at n=19A381190