15374
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 23064
- Proper Divisor Sum (Aliquot Sum)
- 7690
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7686
- Möbius Function
- 1
- Radical
- 15374
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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 unlabeled trivalent 3-connected bipartite planar graphs with 2n nodes.at n=16A007083
- This table shows the coefficients of sum formulas of n-th Fibonacci numbers (A000045). The k-th row (k>=1) contains T(i,k) for i=1 to k, where k=[2*n+1+(-1)^(n-1)]/4 and T(i,k) satisfies F(n)= Sum_{i=1..k} T(i,k) * n^(k-i)/(k-1)!.at n=19A099731
- a(n) = floor(n*(n^3-n-3)/(2*(n-1))).at n=29A117561
- Number of base 26 n-digit numbers with adjacent digits differing by four or less.at n=4A126521
- Expansion of e.g.f. exp(2*x + 3*x^2/2).at n=7A202830
- Numbers n such that Q(sqrt(n)) has class number 9.at n=24A218041
- Number of nX4 0..2 arrays with exactly floor(nX4/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=5A223030
- Number of nX6 0..2 arrays with exactly floor(nX6/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=3A223032
- T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=39A223033
- T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=41A223033
- Number of nX4 0..2 arrays with no more than floor(nX4/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=5A223470
- Number of nX6 0..2 arrays with no more than floor(nX6/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=3A223472
- T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=39A223473
- T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=41A223473
- Triangle read by rows: T(n,k) is the number of subpermutations of an n-set whose orbits are each of size at most k.at n=30A261763
- Number of permutations sigma such that |sigma(i+1)-sigma(i)| >= 3 for 1 <= i <= n - 1 and |sigma(i+2)-sigma(i)| >= 3 for 1 <= i <= n - 2.at n=12A279214
- a(1) = 1; a(n+1) = Product_{d|n} (1 + a(d)).at n=7A333121
- a(n) is the number of singleton commuting ordered set partitions.at n=7A376544
- Array read by antidiagonals: T(n,k) = n! * [x^n] exp(2*x + (k/2)*x^2), n >= 0, k >= 0.at n=62A376826