13550
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25296
- Proper Divisor Sum (Aliquot Sum)
- 11746
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5400
- Möbius Function
- 0
- Radical
- 2710
- 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
- 45
- 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 glycols with n carbon atoms.at n=10A000634
- Number of length 6 walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part.at n=10A064046
- a(n) = A127359(n+1)/2 - A127359(n).at n=8A126931
- Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k+1) for k >= 1.at n=36A126953
- Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A126931.at n=36A171509
- Number of distinct connected planar figures that can be formed from 1 X 2 rectangles (or dominoes) such that each pair of touching rectangles shares exactly one edge, of length 1.at n=5A216595
- Numbers n such that sum of cubes of digits of n equals the sum of prime divisors of n.at n=6A217531
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 2 array.at n=24A219680
- Number of partitions of n for which (number of occurrences of the least part) = (number of occurrences of greatest part).at n=43A236543
- Number of partitions p of n such that (number of numbers in p of form 3k+2) > (number of numbers in p of form 3k).at n=39A241742
- Starts of runs of 3 consecutive Zeckendorf-Niven numbers (A328208).at n=16A328210
- Numbers k such that A338338(k) is a prime p that ends a run of three terms in A338338 that are divisible by p.at n=42A338344
- Expansion of 1 + Sum_{i>=1} Sum_{j>=1} x^(i*j) * Product_{k=1..i*j-1} (1+x^k).at n=49A373030