15030
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 39312
- Proper Divisor Sum (Aliquot Sum)
- 24282
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3984
- Möbius Function
- 0
- Radical
- 5010
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 208
- 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
- yes
- Odd
- no
Appears in sequences
- Number of sensed planar maps with n edges.at n=7A006384
- a(0) = 1, a(n) = 13*n^2 + 2 for n>0.at n=34A010004
- Triangle T(n,m)= Sum_{i=0..n} L'(n,i)*Product_{j=1..m} (i-j+1), read by rows.at n=23A059114
- Triangle read by rows, T(n, k) = Sum_{i=0..n} L'(n, n-i) * binomial(i, k), for k = 0..n-1.at n=16A059374
- Numbers n such that n+2*prime(n) is a perfect square.at n=37A104776
- Subset of A020342 (vampire numbers, definition 1) listing numbers which have more than one such representation of the desired form.at n=9A144563
- 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, -1, 0), (-1, 1, 1), (0, 1, -1), (1, -1, 1), (1, 0, 0)}.at n=9A148415
- Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n.at n=20A175760
- Number of nondecreasing sequences of 7 1..n integers with no element dividing the sequence sum.at n=12A212874
- Number of (n+1) X (3+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=14A250724
- Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=31A257740
- Numbers k such that k! + 2^k + 3 or k! + 2^k - 3 is prime.at n=15A263469
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 814", based on the 5-celled von Neumann neighborhood.at n=33A273644
- Sum of piles of first n primes: a(n) = Sum(prime(i)*(2*i-1): 1<=i<=n).at n=18A316322
- Number of multisets of nonempty words with a total of n letters over ternary alphabet such that all letters occur at least once in the multiset.at n=4A320213
- Maximal coefficient of Product_{j=1..n} (1 - x^prime(j)).at n=31A350514
- Maximum of the absolute value of the coefficients of (1 - x^2) * (1 - x^3) * (1 - x^5) * ... * (1 - x^prime(n)).at n=31A367843
- Triangle read by rows: T(n,k) is the number of sensed combinatorial maps with n edges and genus k, 0 <= k <= floor(n/2).at n=16A379438
- Absolute value of the minimum coefficient of (1 - x^2) * (1 - x^3) * (1 - x^5) * ... * (1 - x^prime(n)).at n=31A379976