8310
domain: N
Properties
Digital Properties
- Digit Count
- 4
- 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
- 20016
- Proper Divisor Sum (Aliquot Sum)
- 11706
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2208
- Möbius Function
- 1
- Radical
- 8310
- 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
- 65
- 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
- Trajectory of 1 under map n->43n+1 if n odd, n->n/2 if n even.at n=32A033977
- Denominators of continued fraction convergents to cosh(1).at n=8A078982
- a(0)=a(1)=-1. For n>1: a(n)=Sum(i!i^2 Stirling2[n-1,i],i=2,..,n-1).at n=6A091106
- Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.at n=58A100862
- Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.at n=62A100862
- Numbers k such that d(k)*reversal(k)=phi(k), where d(k) is number of positive divisors of k.at n=3A104906
- Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m.at n=30A111045
- Numbers k such that phi(k) + prime(k) is a triangular number.at n=33A115908
- Numbers n such that sqrt(36*n+49) is prime.at n=33A168669
- Numbers n for which n' + n and n' - n are both prime, n' being the arithmetic derivative of n.at n=22A229272
- E.g.f.: exp(9*x*G(x)^8) / G(x) where G(x) = 1 + x*G(x)^9 is the g.f. of A062994.at n=3A251669
- Least m > 0 such that gcd(m^(2n+1)+2, (m+1)^(2n+1)+2) > 1.at n=6A255832
- Least k > 0 such that gcd(k^n+2, (k+1)^n+2) > 1, or 0 if there is no such k.at n=15A255852
- Numbers n such that T(n) + T(n+1) + ... + T(n+12) is a square, where T = A000217 (triangular numbers).at n=6A257293
- Number of distinct subsemigroups of the multiplicative semigroup of integers modulo n.at n=44A272213
- Record values in A243145.at n=41A299112
- Central column of A326721.at n=5A326720
- Irregular array related to the Euler numbers, read by rows, T_row(n) = A326722_row(2*n) + A326722_row(2*n+1) for n >= 0, T_row(-1) = [1].at n=30A326721
- T(n, k) = n! * [x^k] [y^n] sec(z)(x + z*sin(z)/y) where z = y*sqrt(x^2 - 1) for 0 <= k <= n+1 and T(-1, 0) = 1, triangle read by rows.at n=50A326722
- Triangle with Euler (secant) numbers, read by rows, T(n, k) for 0 <= k <= n.at n=12A326724