13302
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 28860
- Proper Divisor Sum (Aliquot Sum)
- 15558
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4428
- Möbius Function
- 0
- Radical
- 4434
- 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
- yes
- Harshad Number
- yes
- 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 connected labeled chordal graphs (or triangulated graphs) with n nodes.at n=5A007134
- Expansion of Product_{m>=1} (1-m*q^m)^-3.at n=9A022727
- Positive numbers k such that k and 2*k are anagrams in base 4 (written in base 4).at n=32A023059
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=35A025005
- Triangle T(n,k) of n X n binary matrices with k=0..n^2 ones, up to rotational symmetry.at n=40A054772
- Numbers k such that binomial(2k,k)+1 is prime.at n=35A066699
- Self-convolution of A073711.at n=41A073712
- Number of partitions of n into parts that are odd or == +- 4 mod 10.at n=46A134157
- 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, 0, 0), (1, -1, 0), (1, 0, 0), (1, 1, -1), (1, 1, 1)}.at n=7A150858
- a(n) = 9*n^2 - 10*n + 3.at n=39A154262
- a(n) = n*(2*n^2 + 5*n + 1).at n=18A163832
- Number of n X n 0..4 arrays with each element equal to the number of its horizontal and vertical neighbors equal to itself.at n=6A195963
- Number of nX7 0..4 arrays with each element equal to the number its horizontal and vertical neighbors equal to itself.at n=6A195968
- a(n) = n*(21*n-17)/2.at n=36A226491
- A sequence related to Le Corbusier's Modulor: round(phi^(-13 + n)*175).at n=22A227572
- Number of distinct lines passing through at least three points in a triangular grid of side n.at n=30A234248
- a(n) = A276452(n) + A276451(n) + A276449(n).at n=4A276454
- Number of compositions (ordered partitions) of n into distinct prime powers (including 1).at n=30A331925
- Number of subsets of {1..n} where some element is a difference of two consecutive elements.at n=14A364466