13293
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22048
- Proper Divisor Sum (Aliquot Sum)
- 8755
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7560
- Möbius Function
- 0
- Radical
- 4431
- 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
- 120
- 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
- no
- Odd
- yes
Appears in sequences
- Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=30A015994
- a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=31A023109
- Least number of Reverse-then-add persistence n.at n=31A033866
- Number of noncrossing connected graphs on n nodes on a circle having no triangular faces.at n=6A045743
- Partition numbers rounded to nearest integer given by the Hardy-Ramanujan approximate formula.at n=33A050811
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.at n=36A057287
- Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k triangles. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....at n=21A089435
- Half-sum (or average) of cubes of two distinct odd primes.at n=32A138855
- Maximum number of points visible from some point in a cubic n x n x n lattice.at n=24A141227
- Sum of the distances from a fixed node (root) to the next node in all non-crossing graphs on n nodes on a circle.at n=5A143020
- a(n) = 46*n^2 - 1.at n=16A158634
- Numbers n such that n^6 + 272 is prime.at n=16A161998
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 694", based on the 5-celled von Neumann neighborhood.at n=28A273411
- a(n) = 13*2^(n+1) - 19.at n=9A275163
- Triangle of coefficients T(n,k) of y^k in Product_{k=0..n-1} (1 + (k+2)*y + y^2), read by rows of terms k = 0..2*n, for n >= 0.at n=41A324960
- Triangle of coefficients T(n,k) of y^k in Product_{k=0..n-1} (1 + (k+2)*y + y^2), read by rows of terms k = 0..2*n, for n >= 0.at n=43A324960
- a(n) is the coefficient of y^n in Product_{k=0..n} (1 + (k+2)*y + y^2), for n >= 0.at n=5A324962
- G.f.: Sum_{n>=0} x^n * Product_{k=0..n-1} ( 1 + (1+x)^(n+k) ).at n=7A338179
- a(n) = 1 + Sum_{k=0..n} (2*k - 1)*A349976(n, k).at n=10A349974
- Number of up/down (or down/up) patterns of length n.at n=8A350354