15038
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23088
- Proper Divisor Sum (Aliquot Sum)
- 8050
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7344
- Möbius Function
- -1
- Radical
- 15038
- Omega Function (Ω)
- 3
- 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
- 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
- Fibonacci sequence beginning 2, 14.at n=16A022369
- a(n) = T(n,n), where T is the array in A026148.at n=11A026151
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=22A045156
- Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.at n=17A073476
- Expansion of (1 - x + x^2)*(1 + x + x^2 - x^3 + 2*x^4)/((1 - x)*(1 + x)^2*(1 + x^2)*(1 + x - x^2 + x^3)).at n=14A104237
- Number of partitions of n having no parts equal to the size of their Durfee squares.at n=43A118199
- A004001[n + 1]*Fibonacci[n + 1] - 2*A004001[n]*Fibonacci[n] + A004001[n - 1]*Fibonacci[n - 1].at n=18A120472
- Number of 9's in the last section of the set of partitions of n.at n=52A206559
- Expansion of (-x+2*x^2-x^3-x^4-2*x^5)/(-1+3*x-2*x^2-x^4+x^5).at n=16A221949
- Number of (n+1)X(3+1) 0..1 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=5A237854
- Number of (n+1)X(6+1) 0..1 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=2A237857
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=30A237859
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element greater than all horizontal neighbors or less than all vertical neighbors.at n=33A237859
- Number T(n,k) of permutations p of [n] with no fixed points where the maximal displacement of an element equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=50A259784
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 878", based on the 5-celled von Neumann neighborhood.at n=33A273741
- G.f. A(x) satisfies: A( 2*A(x)^2 - 4*A(x)^3 ) = 2*x^2 + 4*x^3.at n=8A290957
- Number of permutations of [n] with no fixed points where the maximal displacement of an element equals five.at n=4A321051