13035
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 10005
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- 1
- Radical
- 13035
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 76
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- a(n) = n*(29*n - 1)/2.at n=30A022286
- Number of ordered rooted trees with n edges such that the rightmost leaf of each subtree is at even level. Equivalently, number of Dyck paths of semilength n with no return descents of odd length.at n=9A033297
- Number of partitions of n into parts not of the form 17k, 17k+7 or 17k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=36A035968
- Positive numbers having the same set of digits in base 7 and base 10.at n=38A037440
- Numbers k such that sigma(sigma(k) - k) = phi(sigma(k) + k).at n=12A074886
- a(n) =60*sum(1<=u<=v<=w<=m,u^2*v^2/w).at n=4A088945
- Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_{k+1}, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists.at n=32A110735
- Larger members of primitive phi-amicable pairs.at n=12A121249
- Maximal number of right triangles in n turns of Pythagoras's snail.at n=35A137515
- Triangle read by rows: T(n,k) is the number of n-Dyck paths containing k odd-length descents to ground level (0<=k<=n).at n=66A143949
- 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, 0), (-1, 1, -1), (0, 1, 0), (1, -1, -1), (1, 0, 1)}.at n=8A149998
- Third accumulation array, T, of the natural number array A000027, by antidiagonals.at n=57A185508
- Triangle T(n,r), read by rows, where the r-th column is expansion of A(x)^r, with A(x) = x * (x+1) * (2*x^4+4*x^3-2*x+1) * (x^4+2*x^3-x+1) / (x^2+x-1)^6.at n=30A187055
- Generalized Riordan array based on the Fine's numbers A000957.at n=56A187913
- Number of partitions of n that have odd sized Ferrers matrix.at n=37A238944
- Integers that are Rhonda numbers to base 30.at n=14A255736
- Number of length-4 0..n arrays with no following elements greater than or equal to the first repeated value.at n=9A267233
- Indices of zeros in A269783.at n=44A269967
- Riordan array(1/(1+x), (1-sqrt(1-4*x))/(2*x)).at n=56A278072
- Numbers k such that 8k+1, 12k+1 and 24k+1 are primes and the last two are also of the form x^2 + 27y^2, so the tetrahedral number T(24k+1) is a Fermat pseudoprime to base 2.at n=8A321867