13570
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 12350
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5104
- Möbius Function
- 1
- Radical
- 13570
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- yes
- Odd
- no
Appears in sequences
- Number of isomorphism classes of anti-commutative closed binary operations on a set of order n, listed by class size.at n=13A079191
- Number of n X n ortho-projection matrices over GF(2). Also, the number of labeled ortho-projection graphs on n vertices.at n=6A081080
- a(n) = (3*n+1)*(3*n+4).at n=38A085001
- 4-almost primes equal to the product of two successive semiprimes.at n=36A108215
- Shadow of Euler's constant exp(1).at n=33A108912
- Number of base 20 circular n-digit numbers with adjacent digits differing by 5 or less.at n=4A125383
- a(n) = (2*n^3 + 5*n^2 + 7*n)/2.at n=22A162264
- The Wiener index of the P_3 X P_n grid, where P_m is the path graph on m nodes. The Wiener index of a connected graph is the sum of distances between all unordered pairs of nodes in the graph.at n=19A180569
- Partial sums of A211681.at n=14A213299
- Numbers n such that 2*n + prime(n) is a square.at n=33A256246
- Consider the sum of the divisors of a number x>1. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach x.at n=11A269307
- Numbers k such that 7*10^k + 39 is prime.at n=27A275067
- Numbers n such that A003145(n) = floor(alpha^2*n)+1, where alpha = 1.839... is the positive real zero of x^3-x^2-x-1.at n=44A278352
- 1/4 of the even edge of least 2-adic valuation of a primitive 3-simplex (0, b=A031173, c=A031174, d=A031175).at n=50A298046
- Number of nX5 0..1 arrays with every element equal to 0, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=7A298551
- Expansion of (1/(1 - x))*Product_{k>=1} (1 - x^prime(k))/(1 - x^k).at n=44A303663
- Number of edges formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=11A331765
- Number of compositions (ordered partitions) of n into distinct squarefree parts.at n=36A331846
- Number of ways to split an integer partition of n into contiguous subsequences with strictly increasing sums.at n=28A336134
- G.f. A(x) satisfies A(x) = 1 + x * A(x)^4 / (1 - x).at n=6A349331