5931
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8580
- Proper Divisor Sum (Aliquot Sum)
- 2649
- 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
- 3948
- Möbius Function
- 0
- Radical
- 1977
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 36
- 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
- no
- Odd
- yes
Appears in sequences
- Number of unlabeled trivalent 3-connected bipartite planar graphs with 2n nodes without subgraphs R2 and R4.at n=15A007084
- Molien series for A_5.at n=51A008628
- Number of n-celled one-sided polyplets.at n=6A030233
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 77.at n=0A031575
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 77.at n=0A031755
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=47A050045
- Number of partitions of n in which each part occurs an odd number (or zero) times.at n=39A055922
- Least k such that k*10^n +/- 1 are twin primes.at n=45A064218
- Riordan array (1/(1-x*c(3*x)), x*c(3*x)/(1-x*c(3*x))), c(x) the g.f. of A000108.at n=51A110519
- a(1) = 7, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime.at n=34A111475
- Size |S| of the largest subset S of {0,1}^n whose measure m(S) is <= 2^n, where m is the additive measure defined on each element x of S by m({x}) = 2^k(x), where k(x) is the number of non-null coordinates of x.at n=17A115993
- a(n) = c is least number such that 10^n/2 -/+ c are primes.at n=29A124049
- Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^5 = 1 + A122103(k).at n=16A128169
- 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, 1), (-1, 1, 0), (0, 0, 1), (1, -1, 1), (1, 1, -1)}.at n=8A148493
- G.f. is the polynomial (1-x^3) * (1-x^6) * (1-x^9) * (1-x^12) * (1-x^15) * (1-x^18) * (1-x^21) * (1-x^24) * (1-x^27) / (1-x)^9.at n=7A162602
- a(n) = 4*n*(n+1) + 3.at n=38A164897
- Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the binomial tree of order n (1 <= k <= 2n-1; entries in row n are the coefficients of the corresponding Wiener polynomial).at n=55A192020
- Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{(k+1)(n+1)*x^(n-k) : 0<=k<=n} and q(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers).at n=53A193951
- Mirror of the triangle A193951.at n=46A193952
- Total number of repeated parts in all partitions of n.at n=22A194452