5350
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10044
- Proper Divisor Sum (Aliquot Sum)
- 4694
- 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
- 2120
- Möbius Function
- 0
- Radical
- 1070
- 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
- 46
- 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
- MacMahon's solid partitions of n in which 4 is the smallest summand.at n=11A002045
- Coordination sequence T5 for Zeolite Code MFS.at n=45A008177
- Molien series for Hecke group H_{3,4}.at n=17A027631
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 4).at n=40A035548
- Number of partitions of n into parts not of the form 21k, 21k+9 or 21k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=30A035987
- Base-7 palindromes that start with 2.at n=27A043016
- A051851(n)/row_index_of(n).at n=42A051852
- Composite numbers arising as sum of first k primes.at n=44A053790
- Column 3 of triangle A055907.at n=11A055909
- McKay-Thompson series of class 45b for Monster.at n=47A058686
- When expressed in base 3 and then interpreted in base 7, is a multiple of the original number.at n=28A062884
- Index k in A095773 where a string of n identical values occurs.at n=19A096183
- 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 peaks of the form ud.at n=24A108446
- Sum of the first 2n+1 primes.at n=25A109723
- Coefficient of x^2 in the polynomial (x-p(n))*(x-p(n+1))*(x-p(n+2))*(x-p(n+3)), where p(k) is the k-th prime.at n=8A127348
- Prime partial sums A007504(k+1) such that A007504(k+1)/k is an integer.at n=5A134129
- a(n) = prime(prime(A028815(n) - 1) - 1) - 1.at n=31A141136
- 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, 0, 1), (0, 1, -1), (0, 1, 1), (1, 0, 0)}.at n=7A150199
- 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, 0, 1), (0, -1, 1), (0, 0, 1), (1, 1, 0)}.at n=7A150231
- Integer part of square root of n^5 = A000584(n).at n=30A155013