5341
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 6270
- Proper Divisor Sum (Aliquot Sum)
- 929
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4536
- Möbius Function
- 0
- Radical
- 763
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 147
- 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
- Site percolation series for hexagonal lattice.at n=12A006739
- Number of compositions into sums of cubes.at n=45A023358
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=32A024837
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=31A024842
- Numbers whose set of base-12 digits is {1,3}.at n=22A032919
- Number of partitions of n with equal number of parts congruent to each of 0, 3 and 4 (mod 5).at n=46A035577
- Numbers whose base-4 representation contains exactly four 1's and two 3's.at n=29A045131
- Has both a primitive and imprimitive representation as x^2 + xy + y^2.at n=39A045897
- Palindromes in factorial base.at n=45A046807
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=41A050061
- Numbers which, when expressed as a sum of distinct primes with maximum product, use a non-maximal number of primes.at n=22A053020
- Number of positive integers <= 2^n of form x^2 + 11 y^2.at n=15A054226
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n.at n=24A057264
- Number of squares (of another matrix) in M_2(n) - the ring of 2 X 2 matrices over Z_n.at n=10A068197
- a(1)=1; a(n) = a(n-1) + [sum of all decimal digits present so far in the sequence].at n=32A072921
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k doubledescents (i.e., dd's).at n=53A108428
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k doubledescents (i.e., dd's).at n=46A108428
- "Correlation triangle" of central binomial coefficients A000984.at n=40A115255
- Partial sums of binomial(2n,n)^2.at n=4A115257
- Start with 1 and repeatedly reverse the digits and add 62 to get the next term.at n=33A118157